| Inducing enhanced suffix arrays for string collections FA Louza, S Gog, GP Telles Theoretical Computer Science 678, 22-39, 2017 | 52 | 2017 |
| 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-15, 2019 | 44 | 2019 |
| 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 | 29 | 2013 |
| Generalized enhanced suffix array construction in external memory FA Louza, GP Telles, S Hoffmann, CDA Ciferri Algorithms for Molecular Biology 12 (1), 26, 2017 | 26 | 2017 |
| 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 | 26 | 2016 |
| 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 | 22 | 2018 |
| 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-5, 2020 | 15 | 2020 |
| Optimal suffix sorting and LCP array construction for constant alphabets FA Louza, S Gog, GP Telles Information Processing Letters 118, 30-34, 2017 | 14 | 2017 |
| Metagenomic analysis through the extended Burrows-Wheeler transform V Guerrini, FA Louza, G Rosone BMC bioinformatics 21, 1-25, 2020 | 12 | 2020 |
| Lyndon array construction during Burrows-Wheeler inversion FA Louza, WF Smyth, G Manzini, GP Telles Journal of Discrete Algorithms 50 (C), 2-9, 2018 | 9 | 2018 |
| 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 | 9 | 2016 |
| Grammar compression by induced suffix sorting DSN Nunes, FA Louza, S Gog, M Ayala-Rincón, G Navarro ACM Journal of Experimental Algorithmics (JEA) 27, 1-33, 2022 | 8 | 2022 |
| Inducing the Lyndon Array FA Louza, S Mantaci, G Manzini, M Sciortino, GP Telles 26th International Symposium on String Processing and Information Retrieval …, 2019 | 8 | 2019 |
| 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 | 8 | 2018 |
| Burrows-Wheeler transform and LCP array construction in constant space FA Louza, T Gagie, GP Telles Journal of Discrete Algorithms 42, 14-22, 2017 | 8 | 2017 |
| Space-efficient merging of succinct de Bruijn graphs L Egidi, FA Louza, G Manzini 26th International Symposium on String Processing and Information Retrieval …, 2019 | 6 | 2019 |
| Induced suffix sorting for string collections FA Louza, S Gog, GP Telles 26th Data Compression Conference (DCC), 43-52, 2016 | 6 | 2016 |
| Algorithms to compute the Burrows-Wheeler Similarity Distribution FA Louza, GP Telles, S Gog, L Zhao Theoretical Computer Science 782, 145-156, 2019 | 5 | 2019 |
| Lossy Compressor Preserving Variant Calling through Extended BWT V Guerrini, FA Louza, G Rosone 15th International Joint Conference on Biomedical Engineering Systems and …, 2022 | 3 | 2022 |
| Space efficient merging of de Bruijn graphs and Wheeler graphs L Egidi, FA Louza, G Manzini Algorithmica, 1-31, 2022 | 3 | 2022 |
Guilherme P. TellesInstituto de Computação, Unicamp在 ic.unicamp.br 的电子邮件经过验证
