A 1.375-approximation algorithm for unsigned translocation sorting

被引：2
|
作者：
Pu, Lianrong [1 ,2 ]
Zhu, Daming [2 ]
Jiang, Haitao [2 ]
机构：
[1] Fuzhou Univ, Coll Math & Comp Sci, Fuzhou, Peoples R China
[2] Shandong Univ, Sch Comp Sci & Technol, Jinan, Peoples R China
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2020年 / 113卷
基金：
中国国家自然科学基金;
关键词：
Genome rearrangement; Approximation algorithm; Translocation; Complexity; SIGNED PERMUTATIONS; TIME ALGORITHM; DISTANCE;
D O I：
10.1016/j.jcss.2020.05.004
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Translocation has been long learned as a basic operation to rearrange the structure of a genome. Translocation sorting asks to find a shortest sequence of translocations that transforms one genome into another, which has attracted attention of many scientists in algorithm design. Signed translocation sorting can be solved in polynomial time. Unsigned translocation sorting turns out to be NP-Hard and Max-SNP-Hard. The best known approximation algorithm by now for unsigned translocation sorting can achieve a performance ratio 1.408. In this paper, we propose a new approximation algorithm for unsigned translocation sorting which can achieve a asymptotic performance ratio 1.375. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码：163 / 178
页数：16
相关论文
共 50 条
  • [1] 1.375-approximation algorithm for sorting by reversals
    Berman, P
    Harmenhalli, S
    Karpinski, M
    ALGORITHMS-ESA 2002, PROCEEDINGS, 2002, 2461 : 200 - 210
  • [2] 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
  • [3] A 1.375-approximation algorithm for sorting by transpositions
    Elias, I
    Hartman, T
    ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2005, 3692 : 204 - 215
  • [4] 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,
  • [5] 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)
  • [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.
    ALGORITHMS IN BIOINFORMATICS, 2014, 8701 : 26 - 37
  • [7] 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
  • [8] 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
  • [9] 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
  • [10] 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
12345