Sorting by transpositions is difficult

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6755 LNCS, Issue PART 1, 2011, Pages 654-665

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

^a UNIVERSITÉ DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BREAK-POINTS; COMPARATIVE GENOMICS; EVOLUTIONARY DISTANCE; FOLLOWING PROBLEM; NP-HARD; SORTING BY TRANSPOSITIONS;

GENES;

COMPUTATIONAL COMPLEXITY;

EID: 79960013534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22006-7_55     Document Type: Conference Paper

References (26)

1. Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: Rearrangement distances. J. Comput. Syst. Sci. 75(6), 359-370 (2009)
2. ?8? rearrangement distances. In: Ziviani, N., Baeza-Yates, R.A. (eds.) SPIRE 2007. LNCS, vol. 4726, pp. 39-49. Springer, Heidelberg (2007)
3. Bafna, V., Pevzner, P.A.: Sorting permutations by transpositions. In: SODA, pp. 614-623 (1995)
4. Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discrete Math. 11(2), 224-240 (1998)
5. Benoît-Gagné, M., Hamel, S.: A new and faster method of sorting by transpositions. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 131-141. Springer, Heidelberg (2007)
6. Bongartz, D.: Algorithmic Aspects of Some Combinatorial Problems in Bioinformatics. PhD thesis, RWTH Aachen University, Germany (2006)
7. Bulteau, L., Fertin, G., Rusu, I.: Sorting by Transpositions is Difficult. CoRR abs/1011.1157 (2010)
8. Chitturi, B., Sudborough, I.H.: Bounding prefix transposition distance for strings and permutations. In: HICSS, p. 468. IEEE Computer Society, Los Alamitos (2008)
9. Christie, D.A.: Sorting permutations by block-interchanges. Inf. Process. Lett. 60(4), 165-169 (1996)
10. Christie, D.A.: Genome Rearrangement Problems. PhD thesis, University of Glasgow, Scotland (1998)
11. Christie, D.A., Irving, R.W.: Sorting strings by reversals and by transpositions. SIAM J. Discrete Math. 14(2), 193-206 (2001)
12. Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. In: SODA, pp. 667-676 (2002)
13. Dias, Z., Meidanis, J.: Sorting by prefix transpositions. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol. 2476, pp. 65-76. Springer, Heidelberg (2002)
14. Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. IEEE/ACMTrans. Comput. Biology Bioinform. 3(4), 369-379 (2006)
15. Eriksson, H., Eriksson, K., Karlander, J., Svensson, L.J., Wästlund, J.: Sorting a bridge hand. Discrete Mathematics 241(1-3), 289-300 (2001)
16. Feng, J., Zhu, D.: Faster algorithms for sorting by transpositions and sorting by block interchanges. ACM Transactions on Algorithms 3(3) (2007)
17. Fertin, G., Labarre, A., Rusu, I., Tannier, É., Vialette, S.: Combinatorics of genome rearrangements. The MIT Press, Cambridge (2009)
18. Gu, Q.-P., Peng, S., Chen, Q.M.: Sorting permutations and its applications in genome analysis. Lectures on Mathematics in the Life Science, vol. 26, pp. 191-201 (1999)
19. Guyer, S.A., Heath, L.S., Vergara, J.P.: Subsequence and run heuristics for sorting by transpositions. Technical report, Virginia State University (1997)
20. Hartman, T., Shamir, R.: A simpler and faster 1.5-approximation algorithm for sorting by transpositions. Inf. Comput. 204(2), 275-290 (2006)
21. Kolman, P., Waleń, T.: Reversal distance for strings with duplicates: Linear time approximation using hitting set. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol. 4368, pp. 279-289. Springer, Heidelberg (2007)
22. Labarre, A.: New bounds and tractable instances for the transposition distance. IEEE/ACM Trans. Comput. Biology Bioinform. 3(4), 380-394 (2006)
23. Labarre, A.: Edit distances and factorisations of even permutations. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 635-646. Springer, Heidelberg (2008)
24. Qi, X.-Q.: Combinatorial Algorithms of Genome Rearrangements in Bioinformatics. PhD thesis, University of Shandong, China (2006)
25. Radcliffe, A.J., Scott, A.D.,Wilmer, A.L.: Reversals and transpositions over finite alphabets. SIAM J. Discret. Math. 19, 224-244 (2005)
26. Shapira, D., Storer, J.A.: Edit distance with move operations. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 85-98. Springer, Heidelberg (2002)