research
∙
08/15/2023
Another virtue of wavelet forests?
A wavelet forest for a text T [1..n] over an alphabet σ takes n H_0 (T) ...
share
research
∙
05/10/2023
Acceleration of FM-index Queries Through Prefix-free Parsing
FM-indexes are a crucial data structure in DNA alignment, for example, b...
research
∙
06/21/2021
Computing the original eBWT faster, simpler, and with less memory
Mantaci et al. [TCS 2007] defined the eBWT to extend the definition of t...
research
∙
11/11/2020
PHONI: Streamed Matching Statistics with Multi-Genome References
Computing the matching statistics of patterns with respect to a text is ...
research
∙
06/21/2020
PFP Data Structures
Prefix-free parsing (PFP) was introduced by Boucher et al. (2019) as a p...
research
∙
08/04/2019
Matching reads to many genomes with the r-index
The r-index is a tool for compressed indexing of genomic databases for e...
research
∙
11/16/2018
