18 citations · 38 across the 6 of their papers we have counts for
6 papers
Comparative genomics with succinct colored de Bruijn graphs
Lucas P. Ramos, Felipe A. Louza, Guilherme P. Telles
DNA technologies have evolved significantly in the past years enabling the sequencing of a large number of genomes in a short time. Nevertheless, the underlying computational probl…
Inducing the Lyndon Array
Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini +2
In this paper we propose a variant of the induced suffix sorting algorithm by Nong (TOIS, 2013) that computes simultaneously the Lyndon array and the suffix array of a text in $O(n…
Algorithms to compute the Burrows-Wheeler Similarity Distribution
Felipe A. Louza, Guilherme P. Telles, Simon Gog +1
The Burrows-Wheeler transform (BWT) is a well studied text transformation widely used in data compression and text indexing. The BWT of two strings can also provide similarity meas…
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…
Lyndon Array Construction during Burrows-Wheeler Inversion
Felipe A. Louza, W. F. Smyth, Giovanni Manzini +1
In this paper we present an algorithm to compute the Lyndon array of a string of length as a byproduct of the inversion of the Burrows-Wheeler transform of . Our algorit…
Burrows-Wheeler transform and LCP array construction in constant space
Felipe A. Louza, Travis Gagie, Guilherme P. Telles
In this article we extend the elegant in-place Burrows-Wheeler transform (BWT) algorithm proposed by Crochemore et al. (Crochemore et al., 2015). Our extension is twofold: we first…