2 papers
cs.DS2025
KeBaB: -mer based breaking for finding long MEMs
Nathaniel K. Brown, Lore Depuydt, Mohsen Zakeri +8
Long maximal exact matches (MEMs) are used in many genomics applications such as read classification and sequence alignment. Li's ropebwt3 finds long MEMs quickly because it can of…
cs.DS2025
Faster run-length compressed suffix arrays
Nathaniel K. Brown, Travis Gagie, Giovanni Manzini +2
We first review how we can store a run-length compressed suffix array (RLCSA) for a text of length over an alphabet of size whose Burrows-Wheeler Transform (BWT) consi…