Sorting by transpositions is difficult

SIAM Journal on Discrete Mathematics

Volumn 26, Issue 3, 2012, Pages 1148-1180

  Bulteau, Laurent ^a   Fertin, Guillaume ^a   Rusu, Irena ^a  

^a UNIVERSITÉ DE NANTES   (France)

Author keywords

Comparative genomics; Computational complexity; Theoretical aspects of computational biology; Transposition distance

Indexed keywords

BREAK-POINTS; CAMBRIDGE; CHRISTIE; COMBINATORICS; COMPARATIVE GENOMICS; COMPUTATIONAL BIOLOGY; DISCRETE ALGORITHMS; EVOLUTIONARY DISTANCE; FOLLOWING PROBLEM; GENOME REARRANGEMENTS; NP-HARD; SCOTLAND; SORTING BY TRANSPOSITIONS; TRANSPOSITION DISTANCE; UNIVERSITY OF GLASGOW;

BIOINFORMATICS; COMPUTATIONAL COMPLEXITY;

GENES;

EID: 84867283354     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/110851390     Document Type: Conference Paper

References (26)

1. A. Amir, Y. Aumann, G. Benson, A. Levy, O. Lipsky, E. Porat, S. Skiena, and U. Vishne, Pattern matching with address errors: Rearrangement distances, J. Comput. System Sci., 75 (2009), pp. 359-370.
2. ∞ rearrangement distances, in String Processing and Information Retrieval, Lecture Notes in Comput. Sci. 4726, N. Ziviani and R. A. Baeza-Yates, eds., Springer, Berlin, 2007, pp. 39- 49.
3. V. Bafna and P. A. Pevzner, Sorting permutations by transpositions, in Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 614-623.
4. V. Bafna and P. A. Pevzner, Sorting by transpositions, SIAM J. Discrete Math., 11 (1998), pp. 224-240.
5. M. Benoît-Gagné and S. Hamel, A new and faster method of sorting by transpositions, in Combinatorial Pattern Matching, Lecture Notes in Comput. Sci. 4580, B.Ma and K. Zhang, eds., Springer, Berlin, 2007, pp. 131-141.
6. D. Bongartz, Algorithmic Aspects of Some Combinatorial Problems in Bioinformatics, Ph.D. thesis, Fakultät für Mathematik, Informatik und Naturwissenschaften, RWTH Aachen, Aachen, Germany, 2006.
7. L. Bulteau, G. Fertin, and I. Rusu, Sorting by transpositions is difficult, in Proceedings of the 38th International Colloquium on Automata, Languages and Programming (1), Lecture Notes in Comput. Sci. 6755, L. Aceto, M. Henzinger, and J. Sgall, eds., Springer, Berlin, Heidelberg, 2011, pp. 654-665.
8. B. Chitturi and I. H. Sudborough, Bounding prefix transposition distance for strings and permutations, Theoret. Comput. Sci., 421 (2012), pp. 15-24.
9. D. A. Christie, Sorting permutations by block-interchanges, Inform. Process. Lett., 60 (1996), pp. 165-169.
10. D. A. Christie, Genome Rearrangement Problems, Ph.D. thesis, Department of Computer Science, University of Glasgow, Glasgow, Scotland, 1998.
11. D. A. Christie and R. W. Irving, Sorting strings by reversals and by transpositions, SIAM J. Discrete Math., 14 (2001), pp. 193-206.
12. G. Cormode and S. Muthukrishnan, The string edit distance matching problem with moves, in Proceedings of the Thirteenth Annual Symposium on Discrete Algorithms, 2002, pp. 667-676.
13. Z. Dias and J. Meidanis, Sorting by prefix transpositions, in Proceedings of the 9th International Symposium on String Processing and Information Retrieval, Lecture Notes in Comput. Sci. 2476, A. H. F. Laender and A. L. Oliveira, eds., Springer, London, 2002, pp. 65-76.
14. I. Elias and T. Hartman, A 1.375-approximation algorithm for sorting by transpositions, IEEE/ACM Trans. Comput. Biol. Bioinform., 3 (2006), pp. 369-379.
15. H. Eriksson, K. Eriksson, J. Karlander, L. J. Svensson, and J. Wästlund, Sorting a bridge hand, Discrete Math., 241 (2001), pp. 289-300.
16. J. Feng and D. Zhu, Faster algorithms for sorting by transpositions and sorting by block interchanges, ACM Trans. Algorithms, 3 (2007), 25.
17. G. Fertin, A. Labarre, I. Rusu, É. Tannier, and S. Vialette, Combinatorics of Genome Rearrangements, The MIT Press, Cambridge, MA, 2009.
18. Q.-P. Gu, S. Peng, and Q. M. Chen, Sorting permutations and its applications in genome analysis, in Mathematical and Computational Biology, Lectures Math. Life Sci. 26, AMS, Providence, RI, 1999, pp. 191-201.
19. S. A. Guyer, L. S. Heath, and J. P. Vergara, Subsequence and Run Heuristics for Sorting by Transpositions, Technical report, Virginia Polytechnic Institute and State University, Blacksburg, VA, 1997.
20. T. Hartman and R. Shamir, A simpler and faster 1.5-approximation algorithm for sorting by transpositions, Inform. and Comput., 204 (2006), pp. 275-290.
21. A. Labarre, New bounds and tractable instances for the transposition distance, IEEE/ACM Trans. Comput. Biol. Bioinform., 3 (2006), pp. 380-394.
22. A. Labarre, Edit distances and factorisations of even permutations, in Proceedings of the 16th Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 5193, D. Halperin and K. Mehlhorn, eds., Springer, Berlin, Heidelberg, 2008, pp. 635-646.
23. P. A. Pevzner and M. S. Waterman, Open combinatorial problems in computational molecular biology, in Proceedings of the Third Israel Symposium on the Theory of Computing and Systems, IEEE Computer Society Press, Washington, DC, 1995, pp. 158-173.
24. X.-Q. Qi, Combinatorial Algorithms of Genome Rearrangements in Bioinformatics, Ph.D. thesis, Department of Applied Mathematics, University of Shandong, China, 2006.
25. A. J. Radcliffe, A. D. Scott, and E. L. Wilmer, Reversals and transpositions over finite alphabets, SIAM J. Discrete Math., 19 (2005), pp. 224-244.
26. D. Shapira and J. A. Storer, Edit distance with move operations, in Combinatorial Pattern Matching, Lecture Notes in Comput. Sci. 2373, A. Apostolico and M. Takeda, eds., Springer, Berlin, 2002, pp. 85-98.