Resilient pattern mining, the substrings that stay tau-frequent after any k letter substitutions, can be solved exactly in O(n log n) time and O(n) space.
Pissis, Giovanna Rosone, and Michelle Sweering
1 Pith paper cite this work, alongside 11 external citations. Polarity classification is still indexing.
1
Pith paper citing it
11
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Resilient Pattern Mining
Resilient pattern mining, the substrings that stay tau-frequent after any k letter substitutions, can be solved exactly in O(n log n) time and O(n) space.