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 条
  • [1] A 1.375-approximation algorithm for sorting by transpositions
    Elias, Isaac
    Hartman, Tzvika
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2006, 3 (04) : 369 - 379
  • [2] A new 1.375-approximation algorithm for sorting by transpositions
    Silva, Luiz Augusto G.
    Kowada, Luis Antonio B.
    Rocco, Noraí Romeu
    Walter, Maria Emília M.T.
    arXiv, 2020,
  • [3] A new 1.375-approximation algorithm for sorting by transpositions
    Silva, Luiz Augusto G.
    Kowada, Luis Antonio B.
    Rocco, Norai Romeu
    Walter, Maria Emilia M. T.
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2022, 17 (01)
  • [4] A Faster 1.375-Approximation Algorithm for Sorting by Transpositions
    Cunha, Luis Felipe I.
    Kowada, Luis Antonio B.
    Hausen, Rodrigo de A.
    de Figueiredo, Celina M. H.
    ALGORITHMS IN BIOINFORMATICS, 2014, 8701 : 26 - 37
  • [5] A new 1.375-approximation algorithm for sorting by transpositions
    Luiz Augusto G. Silva
    Luis Antonio B. Kowada
    Noraí Romeu Rocco
    Maria Emília M. T. Walter
    Algorithms for Molecular Biology, 17
  • [6] A Faster 1.375-Approximation Algorithm for Sorting by Transpositions
    Cunha, Luis Felipe I.
    Kowada, Luis Antonio B.
    Hausen, Rodrigo De A.
    De Figueiredo, Celina M. H.
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2015, 22 (11) : 1044 - 1056
  • [7] A 1.375-Approximation Algorithm for Sorting by Transpositions with Faster Running Time
    Alexandrino, Alexsandro Oliveira
    Brito, Klairton Lima
    Oliveira, Andre Rodrigues
    Dias, Ulisses
    Dias, Zanoni
    ADVANCES IN BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, BSB 2022, 2022, 13523 : 147 - 157
  • [8] 1.375-approximation algorithm for sorting by reversals
    Berman, P
    Harmenhalli, S
    Karpinski, M
    ALGORITHMS-ESA 2002, PROCEEDINGS, 2002, 2461 : 200 - 210
  • [9] On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n log n) Time
    Cunha, Luis Felipe I.
    Kowada, Luis Antonio B.
    Hausen, Rodrigo de A.
    de Figueiredo, Celina M. H.
    ADVANCES IN BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 2013, 8213 : 126 - 135
  • [10] A 1.375-approximation algorithm for unsigned translocation sorting
    Pu, Lianrong
    Zhu, Daming
    Jiang, Haitao
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2020, 113 : 163 - 178
12345