Felipe A. Louza

Publication Activity (10 Years)

Years Active: 2013-2023
Publications (10 Years): 39

Top Topics

Cartesian Coordinates

Space Efficient

Compression Algorithm

Top Venues

J. Discrete Algorithms

Theor. Comput. Sci.

Publications

Frederico R. Rosa, Felipe A. Louza, Humberto Luiz Razente
Vetor de sufixos métrico compacto. SBBD (2023)
Veronica Guerrini, Felipe A. Louza, Giovanna Rosone
Lossy Compressor preserving variant calling through Extended BWT. CoRR (2023)
Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
Grammar Compression by Induced Suffix Sorting. ACM J. Exp. Algorithmics 27 (2022)
Lucas P. Ramos, Felipe A. Louza, Guilherme P. Telles
Genome Comparison on Succinct Colored de Bruijn Graphs. SPIRE (2022)
Veronica Guerrini, Felipe A. Louza, Giovanna Rosone
Parallel Lossy Compression for Large FASTQ Files. BIOSTEC (Selected Papers) (2022)
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini
Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs. Algorithmica 84 (3) (2022)
Veronica Guerrini, Felipe A. Louza, Giovanna Rosone
Lossy Compressor Preserving Variant Calling through Extended BWT. BIOINFORMATICS (2022)
Marcelo K. Albertini, Felipe A. Louza
Practical evaluation of Lyndon factors via alphabet reordering. CoRR (2021)
Felipe A. Louza, Neerja Mhaskar, W. F. Smyth
A new approach to regular & indeterminate strings. Theor. Comput. Sci. 854 (2021)
Felipe A. Louza
A simple algorithm for computing the document array. Inf. Process. Lett. 154 (2020)
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini
Space efficient merging of de Bruijn graphs and Wheeler graphs. CoRR (2020)
Felipe A. Louza, Neerja Mhaskar, W. F. Smyth
A New Approach to Regular & Indeterminate Strings. CoRR (2020)
Veronica Guerrini, Felipe A. Louza, Giovanna Rosone
Metagenomic analysis through the extended Burrows-Wheeler transform. BMC Bioinform. (8) (2020)
Felipe A. Louza, Guilherme P. Telles, Simon Gog, Nicola Prezza, Giovanna Rosone
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections. Algorithms Mol. Biol. 15 (1) (2020)
Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
Grammar Compression By Induced Suffix Sorting. CoRR (2020)
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles
External memory BWT and LCP computation for sequence collections with applications. Algorithms Mol. Biol. 14 (1) (2019)
Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, Marinella Sciortino, Guilherme P. Telles
Inducing the Lyndon Array. SPIRE (2019)
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini
Space-efficient merging of succinct de Bruijn graphs. CoRR (2019)
Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao
Algorithms to compute the Burrows-Wheeler Similarity Distribution. CoRR (2019)
Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao
Algorithms to compute the Burrows-Wheeler Similarity Distribution. Theor. Comput. Sci. 782 (2019)
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini
Space-Efficient Merging of Succinct de Bruijn Graphs. SPIRE (2019)
Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, Marinella Sciortino, Guilherme P. Telles
Inducing the Lyndon Array. CoRR (2019)
Felipe A. Louza, William F. Smyth, Giovanni Manzini, Guilherme P. Telles
Lyndon array construction during Burrows-Wheeler inversion. J. Discrete Algorithms 50 (2018)
Felipe A. Louza
A Simple Algorithm for Computing the Document Array. CoRR (2018)
Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
A Grammar Compression Algorithm Based on Induced Suffix Sorting. DCC (2018)
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles
External memory BWT and LCP computation for sequence collections with applications. WABI (2018)
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles
External memory BWT and LCP computation for sequence collections with applications. CoRR (2018)
Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao
Computing Burrows-Wheeler Similarity Distributions for String Collections. SPIRE (2018)
Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
A Grammar Compression Algorithm based on Induced Suffix Sorting. CoRR (2017)
Felipe A. Louza, Simon Gog, Guilherme P. Telles
Optimal suffix sorting and LCP array construction for constant alphabets. Inf. Process. Lett. 118 (2017)
Felipe A. Louza, Guilherme P. Telles, Steve Hoffmann, Cristina Dutra de Aguiar Ciferri
Generalized enhanced suffix array construction in external memory. Algorithms Mol. Biol. 12 (1) (2017)
Felipe A. Louza, W. F. Smyth, Giovanni Manzini, Guilherme P. Telles
Lyndon Array Construction during Burrows-Wheeler Inversion. CoRR (2017)
Felipe A. Louza, Travis Gagie, Guilherme P. Telles
Burrows-Wheeler transform and LCP array construction in constant space. J. Discrete Algorithms 42 (2017)
Felipe A. Louza, Simon Gog, Guilherme P. Telles
Inducing enhanced suffix arrays for string collections. Theor. Comput. Sci. 678 (2017)
Felipe A. Louza, Travis Gagie, Guilherme P. Telles
Burrows-Wheeler transform and LCP array construction in constant space. CoRR (2016)
Felipe A. Louza, Simon Gog, Guilherme P. Telles
Induced Suffix Sorting for String Collections. DCC (2016)
Felipe A. Louza, Simon Gog, Leandro Zanotto, Guido Araujo, Guilherme P. Telles
Parallel Computation for the All-Pairs Suffix-Prefix Problem. SPIRE (2016)
William H. A. Tustumi, Simon Gog, Guilherme P. Telles, Felipe A. Louza
An improved algorithm for the all-pairs suffix-prefix problem. J. Discrete Algorithms 37 (2016)
Felipe A. Louza, Guilherme P. Telles
Computing the BWT and the LCP Array in Constant Space. IWOCA (2015)
Felipe A. Louza, Guilherme P. Telles, Cristina Dutra de Aguiar Ciferri
External Memory Generalized Suffix and LCP Arrays Construction. CPM (2013)