A 1.375-approximation algorithm for sorting by transpositions

被引：0
|
作者：
Elias, I [1 ]
Hartman, T
机构：
[1] Royal Inst Technol, Dept Numer Anal & Comp Sci, Stockholm, Sweden
[2] Weizmann Inst Sci, Dept Mol Genet, IL-76100 Rehovot, Israel
来源：
ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS | 2005年 / 3692卷
关键词：
D O I：
暂无
中图分类号：
Q5 [生物化学];
学科分类号：
071010 ; 081704 ;
摘要：
Sorting permutations by transpositions is an important problem in genome rearrangements. A transposition is a rearrangement operation in which a segment is cut out of the permutation and pasted in a different location. The complexity of this problem is still open and it has been a ten-year-old open problem to improve the best known 1.5-approximation algorithm. In this paper we provide a 1.375-approximation algorithm for sorting by transpositions. The algorithm is based on a new upper bound on the diameter of 3-permutations. In addition, we present some new results regarding the transposition diameter: We improve the lower bound for the transposition diameter of the symmetric group, and determine the exact transposition diameter of 2-permutations and simple permutations.
引用
收藏
页码：204 / 215
页数：12
相关论文
共 50 条
  • [41] A new approximation algorithm for sorting of signed permutations
    Yong He
    Ting Chen
    Journal of Computer Science and Technology, 2003, 18 : 125 - 130
  • [42] A new approximation algorithm for sorting of signed permutations
    He, Y
    Chen, T
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2003, 18 (01) : 125 - 130
  • [43] Faster algorithms for sorting by transpositions and sorting by block-interchanges
    Feng, Jianxing
    Zhu, Daming
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2006, 3959 : 128 - 137
  • [44] On the Complexity of Some Variations of Sorting by Transpositions
    Alexandrino, Alexsandro Oliveira
    Oliveira, Andre Rodrigues
    Dias, Ulisses
    Dias, Zanoni
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2020, 26 (09) : 1076 - 1094
  • [45] On sorting by 3-bounded transpositions
    Mahajan, Meena
    Rama, Raghavan
    Vijayakumar, S.
    DISCRETE MATHEMATICS, 2006, 306 (14) : 1569 - 1585
  • [46] A 2-Approximation Scheme for Sorting Signed Permutations by Reversals, Transpositions, Transreversals, and Block-Interchanges
    Hao, FanChang
    Zhang, Melvin
    Leong, Hon Wai
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2019, 16 (05) : 1702 - 1711
  • [47] A 2-approximation algorithm for sorting by prefix reversals
    Fischer, J
    Ginzinger, SW
    ALGORITHMS - ESA 2005, 2005, 3669 : 415 - 425
  • [48] SA New Approximation Algorithm for Unsigned Translocation Sorting
    Pu, Lianrong
    Zhu, Daming
    Jiang, Haitao
    ALGORITHMS IN BIOINFORMATICS, 2016, 9838 : 269 - 280
  • [49] Sorting of Permutations by Cost-Constrained Transpositions
    Farnoud , Farzad
    Milenkovic, Olgica
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (01) : 3 - 23
  • [50] Working on the problem of sorting by transpositions on genome rearrangements
    Walter, MEMT
    Curado, LRAF
    Oliveira, AG
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2003, 2676 : 372 - 383
12345