A new 1.375-approximation algorithm for sorting by transpositions

被引：0
|
作者：
Silva, Luiz Augusto G. [1 ]
Kowada, Luis Antonio B. [3 ]
Rocco, Noraí Romeu [2 ]
Walter, Maria Emília M.T. [1 ]
机构：
[1] Departmento de Ciência da Computação, Universidade de Brasília, Brasília, Brazil
[2] Departmento de Matemática, Universidade de Brasília, Brasília, Brazil
[3] Instituto de Computação, Universidade Federal Fluminense, Niterói, Brazil
来源：
arXiv | 2020年
关键词：
Approximation ratios - Best approximations - Genome rearrangements - Low bound - NP-hard - Sequences of operations - Simple++ - Sorting by transpositions - Transposition distance problem - Transposition distances;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
35
引用
收藏
相关论文
共 50 条
  • [21] A new approximation algorithm for sorting of signed permutations
    Yong He
    Ting Chen
    Journal of Computer Science and Technology, 2003, 18 : 125 - 130
  • [22] A new approximation algorithm for sorting of signed permutations
    He, Y
    Chen, T
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2003, 18 (01) : 125 - 130
  • [23] Sorting by transpositions
    Bafna, V
    Pevzner, PA
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998, 11 (02) : 224 - 240
  • [24] SA New Approximation Algorithm for Unsigned Translocation Sorting
    Pu, Lianrong
    Zhu, Daming
    Jiang, Haitao
    ALGORITHMS IN BIOINFORMATICS, 2016, 9838 : 269 - 280
  • [25] Sorting by Transpositions Is Difficult
    Bulteau, Laurent
    Fertin, Guillaume
    Rusu, Irena
    AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT I, 2011, 6755 : 654 - 665
  • [26] SORTING BY TRANSPOSITIONS IS DIFFICULT
    Bulteau, Laurent
    Fertin, Guillaume
    Rusu, Irena
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (03) : 1148 - 1180
  • [27] Sorting by weighted reversals, transpositions, and inverted transpositions
    Bader, Martin
    Ohlebusch, Enno
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2007, 14 (05) : 615 - 636
  • [28] Sorting by weighted reversals, transpositions, and inverted transpositions
    Bader, Martin
    Ohlebusch, Enno
    RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY, PROCEEDINGS, 2006, 3909 : 563 - 577
  • [29] A new upper bound for sorting permutations with prefix transpositions
    Nair, Pramod P.
    Sundaravaradhan, Rajan
    Chitturi, Bhadrachalam
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2020, 12 (06)
  • [30] Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach
    Walter, Maria Emilia M. T.
    Sobrinho, Mauro C.
    Oliveira, Eugenia T. G.
    Soares, Lorena S.
    Oliveira, Adilton G.
    Martins, Thelmo E. S.
    Fonseca, Tiago M.
    JOURNAL OF DISCRETE ALGORITHMS, 2005, 3 (2-4) : 342 - 361
12345