A 1.375-approximation algorithm for sorting by transpositions

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

Volumn 3692 LNBI, Issue , 2005, Pages 204-215

  Elias, Isaac ^a   Hartman, Tzvika ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; PROBLEM SOLVING;

APPROXIMATION ALGORITHM; REARRANGEMENT OPERATION; SORTING PERMUTATIONS; TRANSPOSITIONS;

APPROXIMATION THEORY;

EID: 30544441155     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11557067_17     Document Type: Conference Paper

References (23)

1. http://www.sbc.su.se/~cherub/SBT1375_proof.
2. K. Appel and W. Haken. Every planar map is four colorable part I: Discharging. Illinois Journal of Mathematics, 21:429-490, 1977.
3. 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.
4. V. Bafna and P. A. Pevzner. Genome rearragements and sorting by reversals. SIAM Journal on Computing, 25(2):272-289, 1996.
5. V. Bafna and P. A. Pevzner. Sorting by transpositions. SIAM Journal on Discrete Mathematics, 11(2):224-240, May 1998.
6. Preliminary version in the Proceedings of SODA, 1995.
7. A. Bergeron. A very elementary presentation of the Hannenhalli-Pevzner theory. In Combinatorial Pattern Matching (CPM '01), pages 106-117, 2001.
8. P. Berman, S. Hannanhalli, and M. Karpinski. 1.375-approximation algorithm for sorting by reversals. In Proc. of 10th Eurpean Symposium on Algorithms (ESA '02), pages 200-210. Springer, 2002. LNCS 2461.
9. A. Caprara. Sorting permutations by reversals and Eulerian cycle decompositions. SIAM Journal on Discrete Mathematics, 12(1):91-110, February 1999.
10. D. A. Christie. Genome Rearrangement Problems. PhD thesis, University of Glasgow, 1999.
11. H. Eriksson, K. Eriksson, J. Karlander, L. Svensson, and J. Wastlund. Sorting a bridge hand. Discrete Mathematics, 241(1-3):289-300, 2001.
12. 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.
13. T. Hartman. A simpler 1.5-approximation algorithm for sorting by transpositions. In Combinatorial Pattern. Matching (CPM '03), volume 2676, pages 156-169, 2003.
14. 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.
15. 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.
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. Transposition distance between a permutation and its reverse. In Proceedings of the 4th South. American Workshop on String Processing, pages 70-79, 1997.
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 Current Topics in Computational Molecular Biology. MIT Press, 2002.
21. R. Shamir. Algorithms in molecular biology: Lecture notes, 2002. Available at http://www.math.tau.ac.il/~rshamir/algmb/01/algmb01.html.
22. E. Tannier and M.F. Sagot. Sorting by reversals in subquadratic time. In Combinatorial Pattern Matching (CPM '04), volume 3109, pages 1-13, 2004.
23. U. Zwick. Computer assisted proof of optimal approximability results. In Symposium On Discrete Mathematics (SODA-02), pages 496-505, 2002.