2 citations · 3 across the 6 of their papers we have counts for
6 papers
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…
Wheeler maps
Andrej Baláz, Travis Gagie, Adrián Goga +4
Motivated by challenges in pangenomic read alignment, we propose a generalization of Wheeler graphs that we call Wheeler maps. A Wheeler map stores a text and an assignme…
Space-efficient conversions from SLPs
Travis Gagie, Adrián Goga, Artur Jeż +1
We give algorithms that, given a straight-line program (SLP) with rules that generates (only) a text , builds within space the Lempel-Ziv (LZ) parse of (of…
MARIA: Multiple-alignment -index with aggregation
Adrián Goga, Andrej Baláž, Alessia Petescia +1
There now exist compact indexes that can efficiently list all the occurrences of a pattern in a dataset consisting of thousands of genomes, or even all the occurrences of all the p…
Prefix-free parsing for building large tunnelled Wheeler graphs
Adrián Goga, Andrej Baláž
We propose a new technique for creating a space-efficient index for large repetitive text collections, such as pangenomic databases containing sequences of many individuals from th…
SnakeLines: integrated set of computational pipelines for sequencing reads
Jaroslav Budis, Werner Krampl, Marcel Kucharik +12
Background: With the rapid growth of massively parallel sequencing technologies, still more laboratories are utilizing sequenced DNA fragments for genomic analyses. Interpretation…