[HTML][HTML] Lightweight merging of compressed indices based on BWT variants
L Egidi, G Manzini - Theoretical Computer Science, 2020 - Elsevier
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 …
indices based on variants of Burrows-Wheeler transform (BWT), thus addressing the need …
Space-efficient merging of succinct de Bruijn graphs
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 …
introduced in [Bowe et al. WABI 2012]. Our algorithm is based on the lightweight BWT …
Space efficient merging of de Bruijn graphs and Wheeler graphs
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 new …
construction of large succinct indexes. In the first part of the paper we propose a new …
[PDF][PDF] Space-efficient construction of succinct de Bruijn graphs
FA Louza - nms.kcl.ac.uk
Space-efficient construction of succinct de Bruijn graphs Page 1 Space-efficient construction of
succinct de Bruijn graphs Felipe A. Louza University of Sao Paulo, Brazil Joint work with Lavinia …
succinct de Bruijn graphs Felipe A. Louza University of Sao Paulo, Brazil Joint work with Lavinia …