Length-weighted $$\lambda $$-rearrangement distance

Autor: Zanoni Dias, Carla Negri Lintzmayer, Guilherme Henrique Santos Miranda, Alexsandro Oliveira Alexandrino
Rok vydání: 2020
Předmět:
Zdroj: Journal of Combinatorial Optimization. 41:579-602
ISSN: 1573-2886
1382-6905
DOI: 10.1007/s10878-020-00673-2
Popis: Comparative genomics is a field of biology that aims at comparing genomes of different species. One major question of this field is to find the evolutionary distance between two given genomes. One way to estimate such distance is to use the rearrangement distance, which consists in finding a minimum cost sequence of rearrangements that transforms one genome into another. We use permutations to model the genomes being compared and, in this way, we can treat this problem as the problem of sorting a permutation with a minimum cost sequence of rearrangements. In the early works with rearrangement distance, it was considered that all rearrangements are equally likely to occur and, consequently, they use a unitary cost for all rearrangements. Some variations of the problem were motivated by the observation that rearrangements involving large segments of a genome rarely occur. One of these variants also uses a unitary cost, however it adds a constraint in the length of the operations allowed to estimate the distance. Another variant uses a cost function based on the rearrangement’s length. In this work, we study problems that combine both variants, that is, problems with a constraint in the rearrangement’s length and with a cost function based on the rearrangement’s length. We present approximation algorithms for five such problems involving reversals and/or transpositions for sorting signed and unsigned permutations. We also analyze the problems for specific parameters of the length restriction and for when the cost function is equal to $$\ell ^\alpha $$ , where $$\ell $$ is the rearrangement’s length and $$\alpha \ge 1$$ is a real value parameter.
Databáze: OpenAIRE
Externí odkaz: