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 条
  • [31] A constant approximation algorithm for sorting buffers
    Kohrt, JS
    Pruhs, K
    LATIN 2004: THEORETICAL INFORMATICS, 2004, 2976 : 193 - 202
  • [32] Sorting by Weighted Reversals and Transpositions
    Oliveira, Andre Rodrigues
    Brito, Klairton Lima
    Dias, Zanoni
    Dias, Ulisses
    ADVANCES IN BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, BSB 2018, 2018, 11228 : 38 - 49
  • [33] Faster Algorithms for Sorting by Transpositions and Sorting by Block Interchanges
    Feng, Jianxing
    Zhu, Daming
    ACM TRANSACTIONS ON ALGORITHMS, 2007, 3 (03)
  • [34] Sorting by Prefix Reversals and Prefix Transpositions
    Dias, Zanoni
    Dias, Ulisses
    DISCRETE APPLIED MATHEMATICS, 2015, 181 : 78 - 89
  • [35] A Barrier for Further Approximating Sorting by Transpositions
    Silva, Luiz A. G.
    Kowada, Luis A. B.
    Walter, Maria E. M. T.
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2023, 30 (12) : 1277 - 1288
  • [36] Sorting Circular Permutations by Bounded Transpositions
    Feng, Xuerong
    Chitturi, Bhadrachalam
    Sudborough, Hal
    ADVANCES IN COMPUTATIONAL BIOLOGY, 2010, 680 : 725 - 736
  • [37] A new and faster method of sorting by transpositions
    Benoit-Gagne, Maxime
    Hamel, Sylvie
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2007, 4580 : 131 - +
  • [38] On the Complexity of Sorting by Reversals and Transpositions Problems
    Oliveira, Andre Rodrigues
    Brito, Klairton Lima
    Dias, Ulisses
    Dias, Zanoni
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2019, 26 (11) : 1223 - 1229
  • [39] Sorting by Reversals and Transpositions with Proportion Restriction
    Brito, Klairton Lima
    Alexandrino, Alexsandro Oliveira
    Oliveira, Andre Rodrigues
    Dias, Ulisses
    Dias, Zanoni
    ADVANCES IN BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, BSB 2020, 2020, 12558 : 117 - 128
  • [40] An Approximation Algorithm for Sorting by Bounded Singleton Moves
    Xie, Shengjun
    Feng, Haodi
    Jiang, Haitao
    Zhu, Daming
    COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 580 - 590
12345