CV Lattes
ResearcherID
ORCID
Google Scholar Citations
Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC) (Institutional affiliation from the last research proposal) Birthplace: Brazil
Master of Computer Science by the State University of Campinas (2018). Has experience in Computer Science, focusing on Theory of Computing, acting on the following subjects: computational biology, heuristics, genome rearrangement, and approximation algorithms. (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) |
The problem of minimum common string partition is a combinatorial optimization problem of fundamental importances given its theorical and practical aspect. Such problem has the goal of finding the minimum number of substrings necessary to compose two distinct strings changing only the order in which the substrings are concatenated. Many relations were established between variations of thi…
Rearrangement Distance problems are computational problems inspired by biology with many variations that have been studied over time. These problems consist in finding the minimum sequence of rearrangement events, which are large scale mutations, necessary to transform one genome into another. Originally, rearrangement distance problems considered only the gene sequence and assumed that e…
| 1 / 1 | Ongoing scholarships in Brazil |
| 1 / 1 | Completed scholarships abroad |
| 2 / 2 | All Scholarships |
| Associated processes | |