Problems of sorting permutations by fragmentation-weighted operations
The sorting permutations problem using prefix and suffix operations
Sorting permutations by prefix reversals and suffix reversals
Grant number: | 12/14104-0 |
Support Opportunities: | Scholarships in Brazil - Doctorate |
Start date: | January 01, 2013 |
End date: | August 31, 2016 |
Field of knowledge: | Physical Sciences and Mathematics - Computer Science - Theory of Computation |
Principal Investigator: | João Meidanis |
Grantee: | Priscila Do Nascimento Biller |
Host Institution: | Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil |
Associated scholarship(s): | 13/25084-2 - Ancestral artificial genomes, BE.EP.DR |
Abstract Rearrangements are evolutionary events that modify in different ways the order of large segments in genomes. To explain the evolutionary history of a set of species with rearrangements can be seen as an computational optimization problem, called Genome Rearrangement Problem. This problem consists in finding a tree which relates the set of genomes received, minimizing the sum of edge weights, where the weight of an edge is the number of rearrangements that explains the evolution between the genomes of incident vertices. The quality of the inference and the complexity of the problem depend on the rearrangement model used, which formally defines how the genomes can be modified. In this project we will investigate rearrangement problems with the algebraic model, introduced by Meidanis and Dias and extended by Feijão and Meidanis. It is not yet known the efficiency of the algebraic model in rearrangement problems with three or more genomes, in connection with the algebraic model. In this project we intend to investigate these complexities and seeking new forms, more efficient, to solve genome rearrangement problems. | |
News published in Agência FAPESP Newsletter about the scholarship: | |
More itemsLess items | |
TITULO | |
Articles published in other media outlets ( ): | |
More itemsLess items | |
VEICULO: TITULO (DATA) | |
VEICULO: TITULO (DATA) | |