FELIPE A. LOUZA

Assistant Professor @ FEELT · UFU

Research Interests

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

Links



Publications

Books
  1. Felipe A. Louza, Simon Gog, Guilherme P. Telles.
    Construction of Fundamental Data Structures for Strings.
    Springer Briefs in Computer Science, ISBN 978-3-030-55107-0 (2020)
    [Springer]
International journals
  1. Felipe A. Louza.
    A simple algorithm for computing the document array.
    Information Processing Letters, 105887 (2020)
    [Elsevier]
  2. 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]
  3. Veronica Guerrini, Felipe A. Louza, Giovanna Rosone.
    Metagenomic analysis through the extended Burrows-Wheeler transform.
    BMC Bioinformatics, 21: 299 (2020)
    [Springer Nature]
  4. 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]
  5. Felipe A. Louza, Guilherme P. Telles, Simon Gog, Zhao Liang.
    Algorithms to compute the Burrows-Wheeler Similarity Distribution.
    Theoretical Computer Science, 782, 145-156: (2019)
    [Elsevier]
  6. Felipe A. Louza, W. F. Smyth, Giovanni Manzini, Guilherme P. Telles.
    Lyndon Array Construction during Burrows-Wheeler Inversion.
    Journal of Discrete Algorithms, 50, 2-9: (2018)
    [Elsevier]
  7. Felipe A. Louza; Guilherme P. Telles; Steve Hoffmann; Cristina D. A. Ciferri.
    Generalized enhanced suffix array construction in external memory.
    Algorithms for Molecular Biology, 12:26 (2017)
    [Springer Nature]
  8. Felipe A. Louza; Simon Gog; Guilherme P. Telles.
    Inducing enhanced suffix arrays for string collections.
    Theoretical Computer Science, 678: 22-39 (2017)
    [Elsevier]
  9. Felipe A. Louza; Travis Gagie; Guilherme P. Telles.
    Burrows-Wheeler transform and LCP array construction in constant space.
    Journal of Discrete Algorithms, 42: 14-22 (2017)
    [Elsevier]
  10. Felipe A. Louza; Simon Gog; Guilherme P. Telles.
    Optimal suffix sorting and LCP array construction for constant alphabets.
    Information Processing Letters, 118: 30-34 (2017)
    [Elsevier]
  11. William H. A. Tustumi; Simon Gog; Guilherme P. Telles; Felipe A. Louza.
    An improved algorithm for the all-pairs suffix-prefix problem.
    Journal of Discrete Algorithms, 37: 34-43 (2016)
    [Elsevier]
  12. Daniel Y. T. Chino ; Felipe A. Louza ; Agma J. M. Traina ; Cristina D. A. Ciferri ; Caetano Traina Jr.
    Time Series Indexing Taking Advantage of the Generalized Suffix Tree.
    JIDM 3(2): 101-109 (2012)
    [SeerLink]
International conferences
  1. Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, Marinella Sciortino, Guilherme P. Telles.
    Inducing the Lyndon Array.
    SPIRE 2019: 138-151.
    [Springer] [slides]
  2. Lavinia Egidi, Felipe A. Louza, Giovanni Manzini.
    Space-Efficient Merging of Succinct de Bruijn Graphs.
    SPIRE 2019: 337-351.
    [Springer] [slides]
  3. Lavinia Egidi, Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles.
    External memory BWT and LCP computation for sequence collections with applications.
    WABI 2018: 10:1-10:14.
    [DagstuhlLink] [slides]
  4. Felipe A. Louza, Guilherme P. Telles, Simon Gog, Zhao Liang.
    Computing Burrows-Wheeler Similarity Distributions for String Collections.
    SPIRE 2018: 285-296.
    [Springer] [slides]
  5. Daniel S. N. Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro.
    A Grammar Compression Algorithm based on Induced Suffix Sorting.
    DCC 2018: 42-51.
    [IEEE] [slides]
  6. Felipe A. Louza, Simon Gog, Leandro Zanotto, Guido Araujo and Guilherme P. Telles.
    Parallel Computation for the All-Pairs Suffix-Prefix Problem.
    SPIRE 2016: 122-132.
    [Springer] [slides]
  7. Felipe A. Louza; Simon Gog; Guilherme P. Telles.
    Induced Suffix Sorting for String Collections.
    DCC 2016: 43-52.
    [IEEEXplorer] [slides]
  8. Felipe A. Louza; Guilherme P. Telles.
    Computing the BWT and the LCP Array in Constant Space.
    IWOCA 2015: 312-320.
    [Springer] [slides]
  9. Felipe A. Louza; Guilherme P. Telles; Cristina D. A. Ciferri.
    External Memory Generalized Suffix and LCP Arrays Construction.
    CPM 2013: 201-210.
    [Springer] [slides]
  10. Felipe A. Louza; Ricardo R. Ciferri; Cristina D. A. Ciferri.
    Efficiently Querying Protein Sequences with the Proteinus Index.
    BSB 2011: 58-65.
    [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]

Teaching

2020/02
August 2020 - December 2020
Past
  • Design Colaborativo
  • Tecnologias WEB e Mobile
  • Métodos e Técnicas de Programação
  • Programação Procedimental

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