Advanced search
Start date

Problems of sorting permutations by fragmentation-weighted operations

Grant number: 17/16871-1
Support type:Scholarships in Brazil - Master
Effective date (Start): December 01, 2017
Effective date (End): February 28, 2019
Field of knowledge:Physical Sciences and Mathematics - Computer Science - Theory of Computation
Principal researcher:Zanoni Dias
Grantee:Alexsandro Oliveira Alexandrino
Home Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil


Calculating the evolutionary distance between species is an important problem in Computational Biology, and for this we consider sets of mutations that alter large stretches of the genome, which we call genome rearrangements. A genome is represented as a permutation of integers, where each element corresponds to a conserved block (region of high similarity between the genomes to be compared). Due to algebraic properties of permutations, the problem of transforming one genome into another is equivalent to the problem of sorting permutations by rearrangement operations. The most common approach considers that all rearrangements have the same cost, so the goal is to find a minimal sequence of rearrangements that sorts the permutation. However, studies indicate that some rearrangement operations are more likely to occur than others, making approaches in which operations have different costs more realistic. In this weighted approach, the goal is to find a sequence that sorts the permutation, such that the sum of the rearrangements' costs of this sequence is minimal. This project presents a new version for the problem of sorting permutations by weighted operations, where the cost of an operation corresponds to the amount of fragmentation that the operation causes in the permutation. (AU)

News published in Agência FAPESP Newsletter about the scholarship:
Articles published in other media outlets (0 total):
More itemsLess items

Scientific publications
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
MIRANDA, GUILHERME HENRIQUE SANTOS; ALEXANDRINO, ALEXSANDRO OLIVEIRA; LINTZMAYER, CARLA NEGRI; DIAS, ZANONI. Approximation Algorithms for Sorting lambda-Permutations by lambda-Operations. ALGORITHMS, v. 14, n. 6 JUN 2021. Web of Science Citations: 0.
RODRIGUES, CAROLINE MAZINI; SORIANO-VARGAS, AUREA; LAVI, BAHRAM; ROCHA, ANDERSON; DIAS, ZANONI. Manifold Learning for Real-World Event Understanding. IEEE Transactions on Information Forensics and Security, v. 16, p. 2957-2972, 2021. Web of Science Citations: 0.
ALEXANDRINO, ALEXSANDRO OLIVEIRA; LINTZMAYER, CARLA NEGRI; DIAS, ZANONI. Sorting permutations by fragmentation-weighted operations. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, v. 18, n. 2 APR 2020. Web of Science Citations: 0.
Academic Publications
(References retrieved automatically from State of São Paulo Research Institutions)
ALEXANDRINO, Alexsandro Oliveira. Sorting permutations by weighted operations. 2019. 76 f. Master's Dissertation - Universidade Estadual de Campinas (UNICAMP). Instituto de Computação.

Please report errors in scientific publications list by writing to: