Felipe A. Louza

Orcid: 0000-0003-2931-1470

Affiliations:
  • Federal University of Uberlândia, Uberlândia, Brazil


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Vetor de sufixos métrico compacto.
Proceedings of the 38th Brazilian Symposium on Databases, 2023

2022
Grammar Compression by Induced Suffix Sorting.
ACM J. Exp. Algorithmics, 2022

Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs.
Algorithmica, 2022

Genome Comparison on Succinct Colored de Bruijn Graphs.
Proceedings of the String Processing and Information Retrieval, 2022

Parallel Lossy Compression for Large FASTQ Files.
Proceedings of the Biomedical Engineering Systems and Technologies, 2022

Lossy Compressor Preserving Variant Calling through Extended BWT.
Proceedings of the 15th International Joint Conference on Biomedical Engineering Systems and Technologies, 2022

2021
A new approach to regular & indeterminate strings.
Theor. Comput. Sci., 2021

Practical evaluation of Lyndon factors via alphabet reordering.
CoRR, 2021

2020
Construction of Fundamental Data Structures for Strings
Springer Briefs in Computer Science, Springer, ISBN: 978-3-030-55107-0, 2020

A simple algorithm for computing the document array.
Inf. Process. Lett., 2020

Metagenomic analysis through the extended Burrows-Wheeler transform.
BMC Bioinform., 2020

gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections.
Algorithms Mol. Biol., 2020

2019
Algorithms to compute the Burrows-Wheeler Similarity Distribution.
Theor. Comput. Sci., 2019

External memory BWT and LCP computation for sequence collections with applications.
Algorithms Mol. Biol., 2019

Inducing the Lyndon Array.
Proceedings of the String Processing and Information Retrieval, 2019

Space-Efficient Merging of Succinct de Bruijn Graphs.
Proceedings of the String Processing and Information Retrieval, 2019

2018
Lyndon array construction during Burrows-Wheeler inversion.
J. Discrete Algorithms, 2018

Computing Burrows-Wheeler Similarity Distributions for String Collections.
Proceedings of the String Processing and Information Retrieval, 2018

A Grammar Compression Algorithm Based on Induced Suffix Sorting.
Proceedings of the 2018 Data Compression Conference, 2018

2017
Engineering augmented suffix sorting algorithms.
PhD thesis, 2017

Inducing enhanced suffix arrays for string collections.
Theor. Comput. Sci., 2017

Burrows-Wheeler transform and LCP array construction in constant space.
J. Discrete Algorithms, 2017

Optimal suffix sorting and LCP array construction for constant alphabets.
Inf. Process. Lett., 2017

Generalized enhanced suffix array construction in external memory.
Algorithms Mol. Biol., 2017

2016
An improved algorithm for the all-pairs suffix-prefix problem.
J. Discrete Algorithms, 2016

Parallel Computation for the All-Pairs Suffix-Prefix Problem.
Proceedings of the String Processing and Information Retrieval, 2016

Induced Suffix Sorting for String Collections.
Proceedings of the 2016 Data Compression Conference, 2016

2015
Computing the BWT and the LCP Array in Constant Space.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2013
External Memory Generalized Suffix and LCP Arrays Construction.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012
Time Series Indexing Taking Advantage of the Generalized Suffix Tree.
J. Inf. Data Manag., 2012

2011
Efficiently Querying Protein Sequences with the Proteinus Index.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2011

Telesto: Indexação de Séries Temporais por Meio de Árvores de Sufixo Generalizadas.
Proceedings of the XXVI Simpósio Brasileiro de Banco de Dados, 2011


  Loading...