A 1.375-approximation algorithm for sorting by transpositions

IEEE/ACM Transactions on Computational Biology and Bioinformatics

Volumn 3, Issue 4, 2006, Pages 369-379

  Elias, Isaac ^a   Hartman, Tzvika ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

Computational biology; Genome rearrangements; Sorting permutations by transpositions

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; GENES; PROBLEM SOLVING;

COMPUTATIONAL BIOLOGY; GENOME REARRANGEMENTS; SORTING PERMUTATIONS BY TRANSPOSITIONS;

ALGORITHMS;

ALGORITHM; ARTICLE; CHROMOSOME MAP; DNA SEQUENCE; GENE LINKAGE DISEQUILIBRIUM; GENETICS; METHODOLOGY; MOLECULAR EVOLUTION; NUCLEOTIDE SEQUENCE; TRANSPOSON;

ALGORITHMS; CHROMOSOME MAPPING; DNA MUTATIONAL ANALYSIS; DNA TRANSPOSABLE ELEMENTS; EVOLUTION, MOLECULAR; LINKAGE DISEQUILIBRIUM; SEQUENCE ANALYSIS, DNA;

EID: 33845654494     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2006.44     Document Type: Conference Paper

References (26)

1. http://www.sbc.su.se/~cherub/SBT1375_proof, 2006.
2. K. Appel and W. Haken, "Every Planar Map Is Four Colorable Part I: Discharging," Illinois J. Math., vol. 21, pp. 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," J. Computational Biology, vol. 8, no. 5, pp. 483-491, 2001.
4. V. Bafna and P.A. Pevzner, "Genome Rearragements and Sorting by Reversals," SIAM J. Computing, vol 25, no. 2, pp. 272-289, 1996.
5. V. Bafna and P.A. Pevzner, "Sorting by Transpositions," SIAM J. Discrete Math., vol. 11, no. 2, pp. 224-240, May 1998.
6. A. Bergeron, "A Very Elementary Presentation of the Hannenhalli-Pevzner Theory," Discrete Applied Math., vol. 146, pp. 134-145, 2005.
7. P. Berman, S. Hannanhalli, and M. Karpinski, "1.375-Approximation Algorithm for Sorting by Reversals," Proc. 10th European Symp. Algorithms (ESA '02), pp. 200-210, 2002.
8. A. Caprara, "Sorting Permutations by Reversals and Eulerian Cycle Decompositions," SIAM J. Discrete Math., vol. 12, no. 1, pp. 91-110, Feb. 1999.
9. D.A. Christie, "Genome Rearrangement Problems," PhD thesis, Univ. of Glasgow, 1999.
10. I. Elias and T. Hartman, "A 1.375-Approximation Algorithm for Sorting by Transpositions," Proc. Fifth Workshop Algorithms in Bioinformatics (WABI '05), pp. 204-215, 2005.
11. H. Eriksson, K. Eriksson, J. Karlander, L. Svensson, and J. Wastlund, "Sorting a Bridge Hand," Discrete Math., vol. 241, nos. 1-3, pp. 289-300, 2001.
12. Q.P. Gu, S. Peng, and H. Sudborough, "A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions," Theoretical Computer Science, vol. 210, no. 2, pp. 327-339, 1999.
13. S. Hannenhalli and P. Pevzner, "Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals," J. ACM, vol. 46, pp. 1-27, 1999.
14. T. Hartman and R. Shamir, "A Simpler and Faster 1.5-Approximation Algorithm for Sorting by Transpositions," Information and Computation, vol. 204, no. 2, pp. 275-290, Feb. 2006.
15. T. Hartman and R. Sharan, "A 1.5-Approximation Algorithm for Sorting by Transpositions and Transreversals," J. Computer and System Sciences, vol. 70, pp. 300-320, 2005.
16. S.B. Hoot and J.D. Palmer, "Structural Rearrangements, Including Parallel Inversions, within the Chloroplast Genome of Anemone and Related Genera," J. Molecular Evolution, vol. 38, pp. 274-281, 1994.
17. H. Kaplan, R. Shamir, and R.E. Tarjan, "Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals," SLAM J. Computing, vol. 29, no. 3, pp. 880-892, 2000.
18. G.H. Lin and G. Xue, "Signed Genome Rearrangements by Reversals and Transpositions: Models and Approximations," Theoretical Computer Science, vol. 259, pp. 513-531, 2001.
19. J. Meidanis, M.E. Walter, and Z. Dias, "Transposition Distance between a Permutation and Its Reverse," Proc. Fourth South Am. Workshop String Processing, pp. 70-79, 1997.
20. J.D. Palmer and L.A. Herbon, "Tricircular Mitochondrial Genomes of Brassica and Raphanus: Reversal of Repeat Configurations by Inversion," Nucleic Acids Research, vol. 14, pp. 9755-9764, 1986.
21. P.A. Pevzner, Computational Molecular Biology: An Algorithmic Approach. MIT Press, 2000.
22. P.A. Pevzner and M.S. Waterman, "Open Combinatorial Problems in Computational Molecular Biology," Proc. Third Israel Symp. Theory of Computing and Systems (ISTCS), pp. 158-173, 1995.
23. D. Sankoff and N. El-Mabrouk, "Genome Rearrangement," Current Topics in Computational Molecular Biology, MIT Press, 2002.
24. R. Shamir, Algorithms in Molecular Biology: Lecture Notes, 2002, http://www.math.tau.ac.il/~rshamir/algmb/01/algmb01.html.
25. E. Tannier and M.F. Sagot, "Sorting by Reversals in Subquadratic Time," Proc. Combinatorial Pattern Matching (CPM '04), pp. 1-13, 2004.
26. U. Zwick, "Computer Assisted Proof of Optimal Approximability Results," Proc. Symp. Discrete Math. (SODA '02), pp. 496-505, 2002.