Parse indexing supplies lower bounds on longest MEM lengths inside pseudo-MEMs, enabling safe discarding of short ones during KeBaB preprocessing.
Faster run-length compressed suffix arrays
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
-
Parse indexing for discarding short pseudo-MEMs safely
Parse indexing supplies lower bounds on longest MEM lengths inside pseudo-MEMs, enabling safe discarding of short ones during KeBaB preprocessing.