Felipe A. Louza

According to our database, Felipe A. Louza authored at least 32 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Vetor de sufixos métrico compacto.

Frederico R. Rosa, Felipe A. Louza, Humberto Luiz Razente

Proceedings of the 38th Brazilian Symposium on Databases, 2023

2022

Grammar Compression by Induced Suffix Sorting.

Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro

ACM J. Exp. Algorithmics, 2022

Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs.

Lavinia Egidi, Felipe A. Louza, Giovanni Manzini

Algorithmica, 2022

Genome Comparison on Succinct Colored de Bruijn Graphs.

Lucas P. Ramos, Felipe A. Louza, Guilherme P. Telles

Proceedings of the String Processing and Information Retrieval, 2022

Parallel Lossy Compression for Large FASTQ Files.

Veronica Guerrini, Felipe A. Louza, Giovanna Rosone

Proceedings of the Biomedical Engineering Systems and Technologies, 2022

Lossy Compressor Preserving Variant Calling through Extended BWT.

Veronica Guerrini, Felipe A. Louza, Giovanna Rosone

Proceedings of the 15th International Joint Conference on Biomedical Engineering Systems and Technologies, 2022

2021

A new approach to regular & indeterminate strings.

Felipe A. Louza, Neerja Mhaskar, W. F. Smyth

Theor. Comput. Sci., 2021

Practical evaluation of Lyndon factors via alphabet reordering.

Marcelo K. Albertini, Felipe A. Louza

CoRR, 2021

2020

Construction of Fundamental Data Structures for Strings

Felipe A. Louza, Simon Gog, Guilherme P. Telles

Springer Briefs in Computer Science, Springer, ISBN: 978-3-030-55107-0, 2020

A simple algorithm for computing the document array.

Felipe A. Louza

Inf. Process. Lett., 2020

Metagenomic analysis through the extended Burrows-Wheeler transform.

Veronica Guerrini, Felipe A. Louza, Giovanna Rosone

BMC Bioinform., 2020

gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections.

Felipe A. Louza, Guilherme P. Telles, Simon Gog, Nicola Prezza, Giovanna Rosone

Algorithms Mol. Biol., 2020

2019

Algorithms to compute the Burrows-Wheeler Similarity Distribution.

Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao

Theor. Comput. Sci., 2019

External memory BWT and LCP computation for sequence collections with applications.

Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles

Algorithms Mol. Biol., 2019

Inducing the Lyndon Array.

Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, Marinella Sciortino, Guilherme P. Telles

Proceedings of the String Processing and Information Retrieval, 2019

Space-Efficient Merging of Succinct de Bruijn Graphs.

Lavinia Egidi, Felipe A. Louza, Giovanni Manzini

Proceedings of the String Processing and Information Retrieval, 2019

2018

Lyndon array construction during Burrows-Wheeler inversion.

Felipe A. Louza, William F. Smyth, Giovanni Manzini, Guilherme P. Telles

J. Discrete Algorithms, 2018

Computing Burrows-Wheeler Similarity Distributions for String Collections.

Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao

Proceedings of the String Processing and Information Retrieval, 2018

A Grammar Compression Algorithm Based on Induced Suffix Sorting.

Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro

Proceedings of the 2018 Data Compression Conference, 2018

2017

Engineering augmented suffix sorting algorithms.

Felipe Alves da Louza

PhD thesis, 2017

Inducing enhanced suffix arrays for string collections.

Felipe A. Louza, Simon Gog, Guilherme P. Telles

Theor. Comput. Sci., 2017

Burrows-Wheeler transform and LCP array construction in constant space.

Felipe A. Louza, Travis Gagie, Guilherme P. Telles

J. Discrete Algorithms, 2017

Optimal suffix sorting and LCP array construction for constant alphabets.

Felipe A. Louza, Simon Gog, Guilherme P. Telles

Inf. Process. Lett., 2017

Generalized enhanced suffix array construction in external memory.

Felipe A. Louza, Guilherme P. Telles, Steve Hoffmann, Cristina Dutra de Aguiar Ciferri

Algorithms Mol. Biol., 2017

2016

An improved algorithm for the all-pairs suffix-prefix problem.

William H. A. Tustumi, Simon Gog, Guilherme P. Telles, Felipe A. Louza

J. Discrete Algorithms, 2016

Parallel Computation for the All-Pairs Suffix-Prefix Problem.

Felipe A. Louza, Simon Gog, Leandro Zanotto, Guido Araujo, Guilherme P. Telles

Proceedings of the String Processing and Information Retrieval, 2016

Induced Suffix Sorting for String Collections.

Felipe A. Louza, Simon Gog, Guilherme P. Telles

Proceedings of the 2016 Data Compression Conference, 2016

2015

Computing the BWT and the LCP Array in Constant Space.

Felipe A. Louza, Guilherme P. Telles

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2013

External Memory Generalized Suffix and LCP Arrays Construction.

Felipe A. Louza, Guilherme P. Telles, Cristina Dutra de Aguiar Ciferri

Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012

Time Series Indexing Taking Advantage of the Generalized Suffix Tree.

Daniel Yoshinobu Takada Chino, Felipe Alves Louza, Agma Juci Machado Traina, Cristina Dutra de Aguiar Ciferri, Caetano Traina Jr.

J. Inf. Data Manag., 2012

2011

Efficiently Querying Protein Sequences with the Proteinus Index.

Felipe Alves da Louza, Ricardo Rodrigues Ciferri, Cristina Dutra de Aguiar Ciferri

Proceedings of the Advances in Bioinformatics and Computational Biology, 2011

Telesto: Indexação de Séries Temporais por Meio de Árvores de Sufixo Generalizadas.

Daniel Yoshinobu Takada Chino, Felipe Alves Louza, Agma Juci Machado Traina, Cristina Dutra de Aguiar Ciferri, Caetano Traina Jr.

Proceedings of the XXVI Simpósio Brasileiro de Banco de Dados, 2011