2 citations · 3 across the 4 of their papers we have counts for
6 papers · 1 filter
In-Place BWT and Lyndon Array Construction in Constant Space
Felipe A. Louza, Arnaud Lefebvre
We present an extension of the in-place BWT algorithm of Crochemore et al. [8] that enables the construction of the Lyndon array using O(1) extra space. Our approach incrementally…
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…
Lossy Compressor preserving variant calling through Extended BWT
Veronica Guerrini, Felipe A. Louza, Giovanna Rosone
A standard format used for storing the output of high-throughput sequencing experiments is the FASTQ format. It comprises three main components: (i) headers, (ii) bases (nucleotide…
A New Approach to Regular & Indeterminate Strings
Felipe A. Louza, Neerja Mhaskar, W. F. Smyth
In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A regular string is one that is "isomorphic" to a string whose entries all consist…
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…
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…