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 条
  • [31] Algorithms for sorting unsigned linear genomes by the DCJ operations
    Jiang, Haitao
    Zhu, Binhai
    Zhu, Daming
    BIOINFORMATICS, 2011, 27 (03) : 311 - 316
  • [32] Sorting Unsigned Permutations by Weighted Reversals,Transpositions,and Transreversals
    娄晓文
    朱大铭
    JournalofComputerScience&Technology, 2010, 25 (04) : 853 - 863
  • [33] On sorting unsigned permutations by double-cut-and-joins
    Chen, Xin
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (03) : 339 - 351
  • [34] Sorting Unsigned Permutations by Weighted Reversals, Transpositions, and Transreversals
    Xiao-Wen Lou
    Da-Ming Zhu
    Journal of Computer Science and Technology, 2010, 25 : 853 - 863
  • [35] A 2-approximation algorithm for sorting by prefix reversals
    Fischer, J
    Ginzinger, SW
    ALGORITHMS - ESA 2005, 2005, 3669 : 415 - 425
  • [36] A simpler 1.5-approximation algorithm for sorting by transpositions
    Hartman, T
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2003, 2676 : 156 - 169
  • [37] A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions
    Oliveira, Andre Rodrigues
    Jean, Geraldine
    Fertin, Guillaume
    Brito, Klairton Lima
    Dias, Ulisses
    Dias, Zanoni
    ALGORITHMS FOR COMPUTATIONAL BIOLOGY (ALCOB 2020), 2020, 12099 : 16 - 28
  • [38] A 1.5-approximation algorithm for sorting by transpositions and transreversals
    Hartman, T
    Sharan, R
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2005, 70 (03) : 300 - 320
  • [39] A 1.5-approximation algorithm for sorting by transpositions and transreversals
    Hartman, T
    Sharan, R
    ALGORITHMS IN BIOINFORMATICS, PROCEEDINGS, 2004, 3240 : 50 - 61
  • [40] A faster algorithm for sorting genomes by reciprocal translocation, insertion and deletion
    Hao, Fanchang
    Luan, Junfeng
    Zhu, Daming
    Zhang, Peng
    Li, Ming
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2010, 47 (11): : 2011 - 2023
12345