A simpler 1.5-approximation algorithm for sorting by transpositions

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

Volumn 2676, Issue , 2003, Pages 156-169

  Hartman, Tzvika ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PATTERN MATCHING;

CHRISTIE; CIRCULAR PERMUTATION; GENOME REARRANGEMENTS; LINEAR PERMUTATION; RUNNING TIME; SORTING BY TRANSPOSITIONS; SORTING PERMUTATIONS BY TRANSPOSITIONS;

APPROXIMATION ALGORITHMS;

EID: 35248843119     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (23)

1. D.A. Bader, B. M.E. Moret, and M. Yan. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. Journal of Computational Biology, 8(5):483-491, 2001.
2. V. Bafna and P. A. Pevzner. Genome rearragements and sorting by reversals. SIAM Journal on Computing, 25(2):272-289, 1996.
3. V. Bafna and P. A. Pevzner. Sorting by transpositions. SIAM Journal on Discrete Mathematics, 11(2):224-240, May 1998.
4. A. Bergeron. A very elementary presentation of the Hannenhalli-Pevzner theory. In Proc. 12th Annual Symposium on Combinaotrial Pattern Matching (CPM '01), 2001.
5. P. Berman, S. Hannanhalli, and M. Karpinski. 1.375-approximation algorithm for sorting by reversals. In Proc. of 10th Eurpean Symposium on Algorith,s (ESA '02), pages 200-210. Springer, 2002. LNCS 2461.
6. A. Caprara. Sorting permutations by reversals and Eulerian cycle decompositions. SIAM Journal on Discrete Mathematics, 12(1):91-110, February 1999.
7. D. A. Christie. A 3/2-approximation algorithm for sorting by reversals. In Proc. ninth annual ACM-SIAM Symp. on Discrete Algorithms (SODA 98), pages 244-252. ACM Press, 1998.
8. D. A. Christie. Genome Rearrangement Problems. PhD thesis, University of Glasgow, 1999.
9. H. Eriksson, K. Eriksson, J. Karlander, L. Svensson, and J. Wastlund. Sorting a bridge hand. Discrete Mathematics, 241(1-3):289-300, 2001.
10. Q. P. Gu, S. Peng, and H. Sudborough. A 2-approximation algorithm for genome rearrangements by reversals and transpositions. Theoretical Computer Science, 210(2):327-339, 1999.
11. S. Hannenhalli and P. Pevzner. Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM, 46:1-27, 1999.
12. (Preliminary version in Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing 1995 (STOC 95), pages 178-189).
13. S. B. Hoot and J. D. Palmer. Structural rearrangements, including parallel inversions, within the chloroplast genome of Anemone and related genera. J. Molecular Evooution, 38:274-281, 1994.
14. H. Kaplan, R. Shamir, and R. E. Tarjan. Faster and simpler algorithm for sorting signed permutations by reversals. SIAM Journal of Computing, 29(3):880-892, 2000.
15. (Preliminary version in Proceedings of the eighth annual ACM-SIAM Symposium on Discrete Algorithms 1997 (SODA 97), ACM Press, pages 344-351).
16. G. H. Lin and G. Xue. Signed genome rearrangements by reversals and transpositions: Models and approximations. Theoretical Computer Science, 259:513-531, 2001.
17. J. Meidanis, M. E. Walter, and Z. Dias. Reversal distance of signed circular chromosomes, manuscript, 2000.
18. J. D. Palmer and L. A. Herbon. Tricircular mitochondrial genomes of Brassica and Raphanus: reversal of repeat configurations by inversion. Nucleic Acids Research, 14:9755-9764, 1986.
19. P. A. Pevzner. Computational Molecular Biology: An Algorithmic Approach. MIT Press, 2000.
20. D. Sankoff and N. El-Mabrouk. Genome rearrangement. In T. Jiang, T. Smith, Y. Xu, and M. Q. Zhang, editors, Current Topics in Computational Molecular Biology. MIT Press, 2002.
21. J. Setubal and J. Meidanis. Introduction to Computational Biology. PWS Publishing Co., 1997.
22. R. Shamir. Algorithms in molecular biology: Lecture notes, 2002. Available at http://www.math.tau.ac.il/∼rshamir/algmb/01/algmb01.html.
23. M. E. Walter, Z. Dias, and J. Meidanis. Reversal and transposition distance of linear chromosomes. In String Processing and Information Retrieval: A South American Symposium (SPIRE 98), 1998.