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.
Indexing compressed text.J
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A linear-time one-pass practical algorithm for building smallest suffixient sets is presented and empirically shown to dominate prior constructions.
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.
-
Practical Linear-Time Computation of Smallest Suffixient Sets
A linear-time one-pass practical algorithm for building smallest suffixient sets is presented and empirically shown to dominate prior constructions.