A new and faster method of sorting by transpositions

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

Volumn 4580 LNCS, Issue , 2007, Pages 131-141

  Benoît Gagné, Maxime ^a   Hamel, Sylvie ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Genome rearrangement; Permutation; Transposition distance

Indexed keywords

ALGORITHMS; BIOINFORMATICS; DNA; MOLECULAR DYNAMICS;

GENOME REARRANGEMENT; PERMUTATION; TRANSPOSITION DISTANCE;

SORTING;

EID: 37849010071     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73437-6_15     Document Type: Conference Paper

References (10)

1. Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discrete Math. 11(2), 224-240 (1998)
2. Christie, D.A.: Genome rearrangements problems, PhD thesis, Glasgow University, Scotland (1998)
3. Elias, I., Hartman, T.: A 1.375-Approximation Algorithm for Sorting by Transpositions. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), vol. 3692, pp. 204-215. Springer, Heidelberg (2005)
4. Eriksson, H., et al.: Sorting a bridge hand. Discrete Mathematics 241, 289-300 (2001)
5. Hartman, T.: A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions. In: Baeza-Yates, R.A., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 156-169. Springer, Heidelberg (2003)
6. Hoot, S.B., Palmer, J.D.: Structural rearrangements, including parallel inversions, within the chloroplast genome of Anemone and related genera. Journal of Molecular Evolution 38, 274-281 (1994)
7. Meidanis, J., Walter, M.E.M.T., Dias, Z.: Transposition distance between a permutation and its reverse. In: Proceedings of the 4th South American Workshop on String Processing (WSP'97), pp. 70-79 (1997)
8. Palmer, J.D., Herbon, L.A.: Tricircular mitochondrial genomes of Brassica and Raphanus: reversal of repeat configurations by inversion. Nucleic Acid Research 14, 9755-9764 (1986)
9. Walter, M.E.M.T., Dias, Z., Meidanis, J.: A new Approach for Approximating the Transposition Distance. In: Proceedings of SPIRE, pp. 199-208 (2000)
10. Walter, M.E.M.T., et al.: Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach. Journal of Discrete Algorithms 3, 342-361 (2005)