FELIPE A. LOUZA

Assistant Professor @ FEELT · UFU

Research Interests

Compact data structures with applications in Bioinformatics, Data Compression, and related areas.

Links



Selected Publications

Books

Articles
  1. Lavinia Egidi, Felipe A. Louza, Giovanni Manzini.
    Space-Efficient Merging of de Bruijn and Wheeler Graphs.
    Algorithmica, 639-669 (2022)
    [Springer]
  2. Daniel S. N. Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro.
    Grammar Compression by Induced Suffix Sorting.
    ACM Journal of Experimental Algorithmics: 1.1:1-1.1:33 (2022).
    [ACM Digital Library]
  3. Felipe A. Louza, Neerja Mhaskar, W. F. Smyth
    A new approach to regular and indeterminate strings.
    Theoretical Computer Science, 854, 105-115 (2021)
    [Elsevier]
  4. Felipe A. Louza, Guilherme P. Telles, Simon Gog, Nicola Prezza, Giovanna Rosone.
    gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections.
    Algorithms for Molecular Biology, 15: 18 (2020)
    [Springer Nature]
  5. Veronica Guerrini, Felipe A. Louza, Giovanna Rosone.
    Metagenomic analysis through the extended Burrows-Wheeler transform.
    BMC Bioinformatics, 21: 299 (2020)
    [Springer Nature]
  6. Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles.
    External memory BWT and LCP computation for sequence collections with applications.
    Algorithms for Molecular Biology, 14(1): 6:1-6:15 (2019)
    [Springer Nature]
  7. Felipe A. Louza; Simon Gog; Guilherme P. Telles.
    Inducing enhanced suffix arrays for string collections.
    Theoretical Computer Science, 678: 22-39 (2017)
    [Elsevier]
  8. Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, Marinella Sciortino, Guilherme P. Telles.
    Inducing the Lyndon Array.
    SPIRE 2019: 138-151.
    [Springer] [slides]
  9. Felipe A. Louza; Guilherme P. Telles.
    Computing the BWT and the LCP Array in Constant Space.
    IWOCA 2015: 312-320.
    [Springer] [slides]
  10. Felipe A. Louza; Guilherme P. Telles; Cristina D. A. Ciferri.
    External Memory Generalized Suffix and LCP Arrays Construction.
    CPM 2013: 201-210.
    [Springer] [slides]
Theses
  1. Felipe A. Louza:
    Engineering augmented suffix sorting algorithms.
    PhD Thesis, University of Campinas, 2017.
    [Repository Unicamp] [slides]
  2. Felipe A. Louza:
    Um algoritmo para a construção de vetores de sufixo generalizados em memória externa. (in portuguese)
    Master's Dissertation, University of São Paulo, 2013.
    [Digital Library USP] [slides]

Students

Current
  • Ana Clara Sousa Silva
  • Filipe Caetano Oliveira de Resende
Former

Teaching

Past
  • Programação Script: 1s2020, 2s2020, 1s2021, 2s2021, 1s2022 , 2s2022, 1s2023
  • Programação Procedimental: 2s2019, 1s2020, 2s2020
  • Design Colaborativo: 2s2019
  • Tecnologias WEB e Mobile: 2s2019
  • Estrutura de Dados: 1s2021, 2s2021, 2s2023
  • Projeto e Análise de Algoritmos: 1s2022, 2s2022, 1s2024
  • Teoria da Computação: 1s2020, 2s2020, 1s2021, 2s2021, 1s2022, 2s2022, 1s2023, 2s2023, 1s2024
  • Resolução de Problemas: 1s2023, 1s2024
  • Resolução de Problemas II: 2s2023

Contact

Office

Room: 3N 314
Faculty of the Electrical Engineering (FEELT)
Federal University of Uberlândia (UFU)
Uberlândia, MG
Brazil

E-mail

louza@ufu.br