Felipe A. Louza
Título
Citado por
Citado por
Año
Inducing enhanced suffix arrays for string collections
FA Louza, S Gog, GP Telles
Theoretical Computer Science 678, 22-39, 2017
322017
External memory generalized suffix and LCP arrays construction
FA Louza, GP Telles, CDA Ciferri
24th Annual Symposium on Combinatorial Pattern Matching (CPM), 201-210, 2013
282013
External memory BWT and LCP computation for sequence collections with applications
L Egidi, FA Louza, G Manzini, GP Telles
Algorithms for Molecular Biology 14 (1), 1-15, 2019
212019
Generalized enhanced suffix array construction in external memory
FA Louza, GP Telles, S Hoffmann, CDA Ciferri
Algorithms for Molecular Biology 12 (1), 1-16, 2017
202017
An improved algorithm for the all-pairs suffix–prefix problem
WHA Tustumi, S Gog, GP Telles, FA Louza
Journal of Discrete Algorithms 37, 34-43, 2016
182016
Optimal suffix sorting and LCP array construction for constant alphabets
FA Louza, S Gog, GP Telles
Information Processing Letters 118, 30-34, 2017
122017
Computing Burrows-Wheeler Similarity Distributions for String Collections
FA Louza, GP Telles, S Gog, L Zhao
25th International Symposium on String Processing and Information Retrieval …, 2018
102018
Lyndon array construction during Burrows-Wheeler inversion
FA Louza, WF Smyth, G Manzini, GP Telles
Journal of Discrete Algorithms 50 (C), 2-9, 2018
82018
Burrows-Wheeler transform and LCP array construction in constant space
FA Louza, T Gagie, GP Telles
Journal of Discrete Algorithms 42, 14-22, 2017
82017
A Grammar Compression Algorithm based on Induced Suffix Sorting
DSN Nunes, FA Louza, S Gog, M Ayala-Rincón, G Navarro
28th Data Compression Conference (DCC), 42-51, 2018
72018
Parallel Computation for the All-Pairs Suffix-Prefix Problem
FA Louza, S Gog, L Zanotto, G Araujo, GP Telles
23rd International Symposium on String Processing and Information Retrieval …, 2016
62016
Induced suffix sorting for string collections
FA Louza, S Gog, GP Telles
26th Data Compression Conference (DCC), 43-52, 2016
62016
Algorithms to compute the Burrows-Wheeler Similarity Distribution
FA Louza, GP Telles, S Gog, L Zhao
Theoretical Computer Science 782, 145-156, 2019
52019
Space-efficient merging of succinct de Bruijn graphs
L Egidi, FA Louza, G Manzini
26th International Symposium on String Processing and Information Retrieval …, 2019
42019
Computing the BWT and the LCP Array in Constant Space
FA Louza, GP Telles
26th International Workshop on Combinatorial Algorithms (IWOCA), 312-320, 2015
42015
Inducing the Lyndon Array
FA Louza, S Mantaci, G Manzini, M Sciortino, GP Telles
26th International Symposium on String Processing and Information Retrieval …, 2019
32019
Metagenomic analysis through the extended Burrows-Wheeler transform
V Guerrini, FA Louza, G Rosone
BMC Bioinformatics 21 (8), 1-25, 2020
22020
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections
FA Louza, GP Telles, S Gog, N Prezza, G Rosone
Algorithms for Molecular Biology 15 (1), 1-5, 2020
12020
Construction of Fundamental Data Structures for Strings
FA Louza, S Gog, GP Telles
Springer Briefs in Computer Science, 2020
12020
A simple algorithm for computing the document array
FA Louza
Information Processing Letters, 105887, 2020
12020
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20