CV Lattes
ORCID
Google Scholar Citations
Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC) (Institutional affiliation from the last research proposal) Birthplace: Brazil
I have a bachelor's degree in Computer Science (1997) from the University of Campinas (Unicamp), a PhD in Computer Science (2002) from the University of Campinas and a post-doctorate in Bioinformatics (2011) from the Virginia Bioinformatics Institute (Virginia Tech). I am currently an Associate Professor (MS-5.3 level) at the Institute of Computing (IC) at Unicamp, Vice-Head of the Department of Theory of Computing (DTC) and coordinator of the extension courses in Data Science (www.ic.unicamp.br/~datascience), Complex Data Mining (www.ic.unicamp.br/~mdc) and Natural Language Processing (www.ic.unicamp.br/~nlp). I have experience in Computer Science, with emphasis on Machine Learning, Bioinformatics, Computational Biology and Combinatorial Optimization. (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 Viva Bem Project endeavors to pioneer advanced technologies by creating novel AI algorithms and methodologies for Health and Well-being, Information Security, and the Internet of Things. These innovations aim to yield superior products and services that augment life quality. Our primary objective is to propel AI's frontier by cultivating technologies, specifically tailored for mobile …
The Data Science Center for Smart Industry acts as an advanced data analytics hub for industry, aiming to improve operational efficiency, product quality, innovation and sustainability through the application of data science and analytics techniques of data in industrial processes. Contact with industries will be mediated by SENAI and operationalized through workshops and thematic meeting…
The main theme of this project is the investigation of several problems on objects of discrete nature, with focus on their algorithmic, structural and theoretical aspects. We will give emphasis to the treatment of "hard problems" (formally known as NP-hard problems), but we will not restrict to this class of problems. We will also consider problems belonging to other complexity classes, a…
Genome Rearrangements is a field of study motivated, in biology, by the comparison of genomes. In particular, it aims at determining how similar two genomes (and thus two species) are. This is useful, among others, for building phylogenetic trees, annotating genomes or correcting already existing annotations. Species differentiation takes place via one or several modifications of its gen…
(Only some records are available in English at this moment)
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…
In this project, we tackle covering problems considering concepts of fairness. Given a universe set U, a family of subsets S, and a coloring function C of the elements from U, we say that a cover (X in S) is fair if the number of covered elements is equally divided between the color classes. Given also a weight function for the elements of U and an integer k, we define the problem of Fair…
In this paper we will propose algorithms to solve the problem of partitioning the edge set of a graph into subsets, so that the subgraph induced by each subset of edges is a circuit, aiming to maximize the number of subsets of the partition. We will also design algorithms for a variation of this problem where the edges of the graph have colors (black or gray) and the subgraphs induced by …
Genome rearrangements are global mutations that affect large portions of the genomes, unlike point mutations that only affect a small number of nucleotides. The number of mutations occurring between genomes can be used as an indicator of the evolutionary distance between them. By the principle of parsimony, we assume that the evolutionary distance between two genomes is given by a minimum…
(Only some records are available in English at this moment)
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…
One way of comparing two genomes is to compute a distance between them. One approach to do this is finding the minimum number of large scale mutations, the genome rearrangements, that occurred to transform one genome into the other. When we represent the genomes as permutations, the goal is to sort a given permutation with the minimum number of rearrangements. Reversals and transpositions…
| 2 / 2 | Ongoing grants |
| 4 / 4 | Completed research grants |
| 1 / 1 | Ongoing scholarships in Brazil |
| 17 / 13 | Completed scholarships in Brazil |
| 2 / 2 | Completed scholarships abroad |
| 26 / 22 | All research grants and scholarships |
| Associated processes | |