1 citations · 1 across the 4 of their papers we have counts for
4 papers
Bounding the Average Move Structure Query for Faster and Smaller RLBWT Permutations
Nathaniel K. Brown, Ben Langmead
The move structure represents permutations with long contiguously permuted intervals in compressed space with optimal query time. They have become an important feature of compresse…
Prefix-free parsing for merging big BWTs
Diego Diaz-Dominguez, Travis Gagie, Veronica Guerrini +5
When building Burrows-Wheeler Transforms (BWTs) of truly huge datasets, prefix-free parsing (PFP) can use an unreasonable amount of memory. In this paper we show how if a dataset c…
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…
Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing
Dominik Kempa, Ben Langmead
Grammar compression is, next to Lempel-Ziv (LZ77) and run-length Burrows-Wheeler transform (RLBWT), one of the most flexible approaches to representing and processing highly compre…