Run-length encoded dictionary matching can be solved in O((runs in patterns + runs in text) log log(pattern length) + occurrences) expected time and O(runs in patterns) space.
Optimal two-dimensional compressed matching
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Compressed Dictionary Matching on Run-Length Encoded Strings
Run-length encoded dictionary matching can be solved in O((runs in patterns + runs in text) log log(pattern length) + occurrences) expected time and O(runs in patterns) space.