Felipe A. Louza

49 papers B 3C 9Journal 32Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Grammar Compression With Support to Fast Substring Extraction.
IEEE Access
Danyelle S. O. Angelo, Daniel Saad Nogueira Nunes, Guilherme P. Telles, Felipe A. Louza
2025 — conf
Algorithms for Computing Very Large BWTs: a Short Survey.
The Expanding World of Compressed Data
Diego Díaz-Domínguez, Lavinia Egidi, Veronica Guerrini, Felipe A. Louza, Giovanna Rosone
2025 C conf
Compact Data Structures for the Metric Suffix Array.
CLEI
Frederico R. Rosa, Felipe A. Louza, Humberto Luiz Razente
2025 J jnl
Comparative genomics with succinct colored de Bruijn graphs.
Acta Informatica
Lucas P. Ramos, Felipe A. Louza, Guilherme P. Telles
2025 J jnl
Faster computation of left-bounded shortest unique substrings.
Algorithms Mol. Biol.
Larissa L. M. Aguiar, Felipe A. Louza
2025 J jnl
In-Place BWT and Lyndon Array Construction in Constant Space.
CoRR
Felipe A. Louza, Arnaud Lefebvre
2025 C conf
Space-Efficient Lyndon Array Construction from Compressed Texts.
LAGOS
Daniel Saad Nogueira Nunes, Felipe A. Louza, Guilherme P. Telles
2024 J jnl
Comparative genomics with succinct colored de Bruijn graphs.
CoRR
Lucas P. Ramos, Felipe A. Louza, Guilherme P. Telles
2023 J jnl
Lossy Compressor preserving variant calling through Extended BWT.
CoRR
Veronica Guerrini, Felipe A. Louza, Giovanna Rosone
2023 — conf
Vetor de sufixos métrico compacto.
SBBD
Frederico R. Rosa, Felipe A. Louza, Humberto Luiz Razente
2022 C conf
Genome Comparison on Succinct Colored de Bruijn Graphs.
SPIRE
Lucas P. Ramos, Felipe A. Louza, Guilherme P. Telles
2022 J jnl
Grammar Compression by Induced Suffix Sorting.
ACM J. Exp. Algorithmics
Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
2022 — conf
Lossy Compressor Preserving Variant Calling through Extended BWT.
BIOINFORMATICS
Veronica Guerrini, Felipe A. Louza, Giovanna Rosone
2022 — conf
Parallel Lossy Compression for Large FASTQ Files.
BIOSTEC (Selected Papers)
Veronica Guerrini, Felipe A. Louza, Giovanna Rosone
2022 J jnl
Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs.
Algorithmica
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini
2021 J jnl
A new approach to regular & indeterminate strings.
Theor. Comput. Sci.
Felipe A. Louza, Neerja Mhaskar, W. F. Smyth
2021 J jnl
Practical evaluation of Lyndon factors via alphabet reordering.
CoRR
Marcelo K. Albertini, Felipe A. Louza
2020 J jnl
A New Approach to Regular & Indeterminate Strings.
CoRR
Felipe A. Louza, Neerja Mhaskar, W. F. Smyth
2020 J jnl
A simple algorithm for computing the document array.
Inf. Process. Lett.
Felipe A. Louza
2020 — book
Construction of Fundamental Data Structures for Strings
Felipe A. Louza, Simon Gog, Guilherme P. Telles
2020 J jnl
Grammar Compression By Induced Suffix Sorting.
CoRR
Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
2020 J jnl
Metagenomic analysis through the extended Burrows-Wheeler transform.
BMC Bioinform.
Veronica Guerrini, Felipe A. Louza, Giovanna Rosone
2020 J jnl
Space efficient merging of de Bruijn graphs and Wheeler graphs.
CoRR
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini
2020 J jnl
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections.
Algorithms Mol. Biol.
Felipe A. Louza, Guilherme P. Telles, Simon Gog, Nicola Prezza, Giovanna Rosone
2019 J jnl
Algorithms to compute the Burrows-Wheeler Similarity Distribution.
CoRR
Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao
2019 J jnl
Algorithms to compute the Burrows-Wheeler Similarity Distribution.
Theor. Comput. Sci.
Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao
2019 J jnl
External memory BWT and LCP computation for sequence collections with applications.
Algorithms Mol. Biol.
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles
2019 C conf
Inducing the Lyndon Array.
SPIRE
Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, Marinella Sciortino, Guilherme P. Telles
2019 J jnl
Inducing the Lyndon Array.
CoRR
Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, Marinella Sciortino, Guilherme P. Telles
2019 C conf
Space-Efficient Merging of Succinct de Bruijn Graphs.
SPIRE
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini
2019 J jnl
Space-efficient merging of succinct de Bruijn graphs.
CoRR
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini
2018 B conf
A Grammar Compression Algorithm Based on Induced Suffix Sorting.
DCC
Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
2018 J jnl
A Simple Algorithm for Computing the Document Array.
CoRR
Felipe A. Louza
2018 C conf
Computing Burrows-Wheeler Similarity Distributions for String Collections.
SPIRE
Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao
2018 C conf
External memory BWT and LCP computation for sequence collections with applications.
WABI
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles
2018 J jnl
External memory BWT and LCP computation for sequence collections with applications.
CoRR
Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles
2018 J jnl
Lyndon array construction during Burrows-Wheeler inversion.
J. Discrete Algorithms
Felipe A. Louza, William F. Smyth, Giovanni Manzini, Guilherme P. Telles
2017 J jnl
A Grammar Compression Algorithm based on Induced Suffix Sorting.
CoRR
Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
2017 J jnl
Burrows-Wheeler transform and LCP array construction in constant space.
J. Discrete Algorithms
Felipe A. Louza, Travis Gagie, Guilherme P. Telles
2017 J jnl
Generalized enhanced suffix array construction in external memory.
Algorithms Mol. Biol.
Felipe A. Louza, Guilherme P. Telles, Steve Hoffmann, Cristina Dutra de Aguiar Ciferri
2017 J jnl
Inducing enhanced suffix arrays for string collections.
Theor. Comput. Sci.
Felipe A. Louza, Simon Gog, Guilherme P. Telles
2017 J jnl
Lyndon Array Construction during Burrows-Wheeler Inversion.
CoRR
Felipe A. Louza, W. F. Smyth, Giovanni Manzini, Guilherme P. Telles
2017 J jnl
Optimal suffix sorting and LCP array construction for constant alphabets.
Inf. Process. Lett.
Felipe A. Louza, Simon Gog, Guilherme P. Telles
2016 J jnl
An improved algorithm for the all-pairs suffix-prefix problem.
J. Discrete Algorithms
William H. A. Tustumi, Simon Gog, Guilherme P. Telles, Felipe A. Louza
2016 J jnl
Burrows-Wheeler transform and LCP array construction in constant space.
CoRR
Felipe A. Louza, Travis Gagie, Guilherme P. Telles
2016 B conf
Induced Suffix Sorting for String Collections.
DCC
Felipe A. Louza, Simon Gog, Guilherme P. Telles
2016 C conf
Parallel Computation for the All-Pairs Suffix-Prefix Problem.
SPIRE
Felipe A. Louza, Simon Gog, Leandro Zanotto, Guido Araujo, Guilherme P. Telles
2015 C conf
Computing the BWT and the LCP Array in Constant Space.
IWOCA
Felipe A. Louza, Guilherme P. Telles
2013 B conf
External Memory Generalized Suffix and LCP Arrays Construction.
CPM
Felipe A. Louza, Guilherme P. Telles, Cristina Dutra de Aguiar Ciferri