CV Lattes
ResearcherID
ORCID
Google Scholar Citations
Universidade de São Paulo (USP). Faculdade de Filosofia, Ciências e Letras de Ribeirão Preto (FFCLRP) (Institutional affiliation from the last research proposal) Birthplace: Brazil
graduation at Bacharelado em Ciências de Computação from Universidade de São Paulo (2011), master's at Computer Science from Universidade de São Paulo (2013) and doctorate at Computer Science from Universidade Estadual de Campinas (2017). Has experience in Computer Science, focusing on Analysis of Algorithms and Computational Complexity (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| More itemsLess items |
| TITULO |
| Articles published in other media outlets ( ): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
Suffix sorting is a fundamental problem in string processing that arises in many applications of Bioinformatics, Information Retrieval and Text Mining. This problem is related to the suffix array construction and the Burrows-Wheeler transform, which play an important role in text indexing (e.g. FM-index) and data compression (e.g. bzip). Several algorithms have been proposed to construct …
Due to technological advances, the amount of biological data (i.e., DNA and proteins sequences) collected, stored in biological databases (BDBs) and available for analysis has increased exponentially. Since many advances in medicine have been obtained through similarity search, there is the challenge of efficiently search these voluminous BDBs. In bioinformatics, similarity search is usua…
It is being under development by the research group headed by the supervisor of this project the Perseus technique, a novel technique that handles persistent suffix trees. The Perseus introduces the following distinctive good properties. It is based on an approach that constructs persistent suffix trees whose sizes may exceed the main memory capacity. Furthermore, it provides an algorithm…
The post-doctoral project conducted by the candidate deals with algorithms to compute the Burrows-Wheeler transform (BWT), and investigate string similarity measures based on the BWT. Recently, Egidi, Louza, Manzini and Telles [7] introduced an external memory algorithm to compute the BWT together with the LCP array for a string collection, and showed how to output the document array (DA)…
The master project conducted by the candidate deals with algorithms to construct and query suffix arrays in external memory. Suffix arrays have been used in different tasks in bioinformatics. Recently Simpson and Durbin (2012) used suffix arrays to assembly genomes efficiently. However, the internal memory requirements impair their usage in large datasets. The objective of the propose…
| 3 / 3 | Completed scholarships in Brazil |
| 2 / 2 | Completed scholarships abroad |
| 5 / 5 | All Scholarships |
| Associated processes | |