First optimal-time O(m + occ) algorithm for contextual pattern matching that runs in the compressed space of a symmetric CDAWG, plus O(log log λ) delay enumeration after O(m) preprocessing of the pattern.
CoRR 2010.07076 (2020), https:// arxiv.org/abs/2010.07076
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal-Time Contextual Pattern Matching in Compressed Space
First optimal-time O(m + occ) algorithm for contextual pattern matching that runs in the compressed space of a symmetric CDAWG, plus O(log log λ) delay enumeration after O(m) preprocessing of the pattern.