3 citations · 3 across the 5 of their papers we have counts for
6 papers
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…
BAT-LZ Out of Hell
Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro
Despite consistently yielding the best compression on repetitive text collections, the Lempel-Ziv parsing has resisted all attempts at offering relevant guarantees on the cost to a…
A Textbook Solution for Dynamic Strings
Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro
We consider the problem of maintaining a collection of strings while efficiently supporting splits and concatenations on them, as well as comparing two substrings, and computing th…
Maintaining the cycle structure of dynamic permutations
Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro
We present a new data structure for maintaining dynamic permutations, which we call a . The FST allows one to efficiently maintain the cycle s…
Matching Statistics speed up BWT construction
Francesco Masillo
Due to the exponential growth of genomic data, constructing dedicated data structures has become the principal bottleneck in common bioinformatics applications. In particular, the…
Suffix sorting via matching statistics
Zsuzsanna Lipták, Francesco Masillo, Simon J. Puglisi
We introduce a new algorithm for constructing the generalized suffix array of a collection of highly similar strings. As a first step, we construct a compressed representation of t…