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.
Big data: principles and paradigms
1 Pith paper cite this work, alongside 3 external citations. Polarity classification is still indexing.
1
Pith paper citing it
3
external citations · OpenAlex
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 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.