Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
MIOV: Reordering MOVI for even better locality
Peter Perešíni, Nathaniel K. Brown, Travis Gagie +1
We consider how to reorder the rows of Nishimoto and Tabei's move structure such that we more often move from one row to the next in memory.
cs.DS2023
Faster Maximal Exact Matches with Lazy LCP Evaluation
Adrián Goga, Lore Depuydt, Nathaniel K. Brown +3
MONI (Rossi et al., {\it JCB} 2022) is a BWT-based compressed index for computing the matching statistics and maximal exact matches (MEMs) of a pattern (usually a DNA read) with re…