Problems of sorting permutations by fragmentation-weighted operations
Sorting permutations by prefix reversals and suffix reversals
The sorting permutations problem using prefix and suffix operations
Grant number: | 19/27331-3 |
Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
Start date: | February 01, 2020 |
End date: | January 22, 2023 |
Field of knowledge: | Physical Sciences and Mathematics - Computer Science - Theory of Computation |
Principal Investigator: | Zanoni Dias |
Grantee: | André Rodrigues Oliveira |
Host Institution: | Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil |
Associated research grant: | 15/11937-9 - Investigation of hard problems from the algorithmic and structural stand points, AP.TEM |
Abstract 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 sequence of genome rearrangements needed to transform one genome into another. In general, problems involving genome rearrangements are computationally difficult to solve. This postdoctoral project proposes to advance the studies of NP-complete problems related to the area of genome rearrangement, focusing on theoretical applications such as approximation algorithms and heuristics. (AU) | |
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) | |