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 genome. The most common mutational events occur at one nucleotide. However, genomes also undergo large scale mutations during the evolutionary process. These mutations present a challenge to the Computational Theory Field, since most of the distance problems are NP-Complete. This research will focus on heuristics, comparative genomic algorithms, and formal proofs that take into consideration the presence of global mutations. The term Genome Rearrangements covers all problems of the following type: given two genomes G1 and G2, and a set of rearrangements, what is the least possible number of such rearrangements that are necessary to obtain G2 starting from G1? This type of algorithmic question has been introduced in the mid-nineties, and has been since studied for many different variants. Our goal with this project is to study several Genome Rearrangement Problems involving reversals and transpositions events. (AU)
Articles published in Agência FAPESP Newsletter about the research grant:
OIKAWA, MARINA A.;
Distances in multimedia phylogeny.
International Transactions in Operational Research,
n. 5, SI,
Web of Science Citations: 0.