5 citations · 5 across the 2 of their papers we have counts for
4 papers
Space efficient merging of de Bruijn graphs and Wheeler graphs
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini
The merging of succinct data structures is a well established technique for the space efficient construction of large succinct indexes. In the first part of the paper we propose a…
Lightweight merging of compressed indices based on BWT variants
Lavinia Egidi, Giovanni Manzini
In this paper we propose a flexible and lightweight technique for merging compressed indices based on variants of Burrows-Wheeler transform (BWT), thus addressing the need for algo…
Space-efficient merging of succinct de Bruijn graphs
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini
We propose a new algorithm for merging succinct representations of de Bruijn graphs introduced in [Bowe et al. WABI 2012]. Our algorithm is based on the lightweight BWT merging app…
External memory BWT and LCP computation for sequence collections with applications
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini +1
We propose an external memory algorithm for the computation of the BWT and LCP array for a collection of sequences. Our algorithm takes the amount of available memory as an input p…