Introduces the first cache-friendly indexing strategy for Wheeler DFAs that combines binary search and sequential scans, achieving up to 500x speedup on pangenome graphs at up to 15x space cost.
A new algorithm for optimal 2-constraint satisfaction and its implications.Theor
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
-
Faster Cache-Efficient Pattern Matching for Deterministic Wheeler Pangenome Graphs
Introduces the first cache-friendly indexing strategy for Wheeler DFAs that combines binary search and sequential scans, achieving up to 500x speedup on pangenome graphs at up to 15x space cost.