Length-weighted λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}-rearrangement distance

被引:0
作者
Alexsandro Oliveira Alexandrino
Guilherme Henrique Santos Miranda
Carla Negri Lintzmayer
Zanoni Dias
机构
[1] University of Campinas,Institute of Computing
[2] Federal University of ABC,Center for Mathematics, Computation and Cognition
关键词
Genome rearrangements; Approximation algorithms; Sorting permutations;
D O I
10.1007/s10878-020-00673-2
中图分类号
学科分类号
摘要
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 ℓα\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell ^\alpha $$\end{document}, where ℓ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell $$\end{document} is the rearrangement’s length and α≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha \ge 1$$\end{document} is a real value parameter.
引用
收藏
页码:579 / 602
页数:23
相关论文
共 63 条
  • [1] Alexandrino AO(2019)Approximation algorithms for sorting permutations by length-weighted short rearrangements Electron Notes Theor Comput Sci 346 29-40
  • [2] Miranda GHS(2020)Sorting permutations by fragmentation-weighted operations J Bioinform Comput Biol 18 2050006.1-2050006.31
  • [3] Lintzmayer CN(2007)Sorting by weighted reversals, transpositions, and inverted transpositions J Comput Biol 14 615-636
  • [4] Dias Z(2008)Improved bounds on sorting by length-weighted reversals J Comput Syst Sci 74 744-774
  • [5] Alexandrino AO(1996)Parametric genome rearrangement Gene 172 GC11-GC17
  • [6] Lintzmayer CN(2012)Sorting by transpositions is difficult SIAM J Discrete Math 26 1148-1180
  • [7] Dias Z(1999)Sorting permutations by reversals and Eulerian cycle decompositions SIAM J Discrete Math 12 91-110
  • [8] Bader M(2013)On sorting unsigned permutations by double-cut-and-joins J Combin Optim 25 339-351
  • [9] Ohlebusch E(2006)A 1.375-approximation algorithm for sorting by transpositions IEEE/ACM Trans Comput Biol Bioinform 3 369-379
  • [10] Bender MA(2002)(1+ Theor Comput Sci 289 517-529