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 条
  • [41] Parallel Memetic Genetic Algorithms for Sorting Unsigned Genomes by Translocations
    da Silveira, Lucas A.
    Soncco-Alvarez, Jose L.
    Ayala-Rincon, Mauricio
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 185 - 192
  • [42] An approximation algorithm for genome sorting by reversals to recover all adjacencies
    Shanshan Zhai
    Peng Zhang
    Daming Zhu
    Weitian Tong
    Yao Xu
    Guohui Lin
    Journal of Combinatorial Optimization, 2019, 37 : 1170 - 1190
  • [43] A quadratic time 2-approximation algorithm for block sorting
    Bein, Wolfgang W.
    Larmore, Lawrence L.
    Morales, Linda
    Sudborough, I. Hal
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 711 - 717
  • [44] An approximation algorithm for genome sorting by reversals to recover all adjacencies
    Zhai, Shanshan
    Zhang, Peng
    Zhu, Daming
    Tong, Weitian
    Xu, Yao
    Lin, Guohui
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (04) : 1170 - 1190
  • [45] A faster and simpler 2-approximation algorithm for block sorting
    Bein, WW
    Larmore, LL
    Morales, L
    Sudborough, IH
    FUNDAMENTALS OF COMPUTATIONAL THEORY, PROCEEDINGS, 2005, 3623 : 115 - 124
  • [46] The 2-approximation algorithm for sorting by prefix transposition revisited
    Islam, Md. Shafiqul
    Rahman, Md. Khaledur
    Rahman, M. Sohel
    2013 INTERNATIONAL CONFERENCE ON INFORMATICS, ELECTRONICS & VISION (ICIEV), 2013,
  • [47] A simpler and faster 1.5-approximation algorithm for sorting by transpositions
    Hartman, T
    Shamir, R
    INFORMATION AND COMPUTATION, 2006, 204 (02) : 275 - 290
  • [48] A Genetic Approach with a Simple Fitness Function for Sorting Unsigned Permutations by Reversals
    Soncco-Alvarez, Jose Luis
    Ayala-Rincon, Mauricio
    2012 7TH COLOMBIAN COMPUTING CONGRESS (CCC), 2012,
  • [49] Parallel Genetic Algorithms with Sharing of Individuals for Sorting Unsigned Genomes by Reversals
    da Silveira, Lucas Angelo
    Soncco-Alvarez, Jose Luis
    Ayala-Rincon, Mauricio
    2017 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2017, : 741 - 748
  • [50] A (1+ε)-Approximation Algorithm for Sorting by Short Block-Moves
    Jiang, Haitao
    Zhu, Daming
    INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION, VOL 1, PROCEEDINGS, 2009, : 580 - 583
12345