Felipe A. Louza
Federal University of Uberlandia
45 Papers
113 Citations
Felipe A. Louza is an academic researcher from Federal University of Uberlandia. The author has contributed to research in topics: LCP array & Suffix array. The author has an hindex of 9, co-authored 42 publications. Previous affiliations of Felipe A. Louza include University of São Paulo & State University of Campinas.
Chat about Author
Papers
Inducing enhanced suffix arrays for string collections
TL;DR: In this paper, Nong et al. presented algorithms g SAIS and g SACA-K to construct the suffix array for a string collection maintaining their theoretical bounds, respecting the order among all suffixes, and improving their practical performance.
50
External memory BWT and LCP computation for sequence collections with applications.
TL;DR: In this paper, the authors propose a space efficient algorithm to compute the Burrows-Wheeler Transform (BWT) and the longest common prefix (LCP) arrays in the external or semi-external memory setting.
Generalized enhanced suffix array construction in external memory.
TL;DR: This article presents and analyzes eGSA, the first external memory algorithm to construct generalized suffix arrays augmented with the longest common prefix array for a string collection, which is validated through performance tests using real datasets from different domains, and showed a competitive performance.
External Memory Generalized Suffix and LCP Arrays Construction
Felipe A. Louza,Guilherme P. Telles,Cristina Dutra de Aguiar Ciferri +2 more
- 17 Jun 2013
TL;DR: This article introduces eGSA, the first external memory algorithm to construct both generalized suffix and LCP arrays for sets of strings, and reduces the time spent to construct the arrays by a factor of 2.8.
An improved algorithm for the all-pairs suffixprefix problem
TL;DR: This article presents another optimal algorithm based on enhanced suffix arrays which further improves the practical running time and is over two times faster and more space-efficient than the method proposed by Ohlebusch and Gog.
25