An approximation algorithm for sorting by reversals and transpositions

Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a combinatorial problem of sorting by reversals and transpositions, the problem of finding a shortest sequence of reversals and transpositions that sorts one genome into the other. In this paper we present a 2k-approximation algorithm for sorting by reversals and transpositions for unsigned permutations where k is the approximation ratio of the algorithm used for cycle decomposition. For the best known value of k our approximation ratio becomes [email protected] for any @d>0. We also derive a lower bound on reversal and transposition distance of an unsigned permutation.

[1]  Marek Karpinski,et al.  1.375-Approximation Algorithm for Sorting by Reversals , 2002, ESA.

[2]  Henrik Eriksson,et al.  Sorting a bridge hand , 2001, Discret. Math..

[3]  J. Palmer,et al.  Tricircular mitochondrial genomes of Brassica and Raphanus: reversal of repeat configurations by inversion. , 1986, Nucleic acids research.

[4]  Tao Jiang,et al.  A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition , 2004, J. Comb. Optim..

[5]  Niklas Eriksen,et al.  (1+epsilon)-Approximation of sorting by reversals and transpositions , 2001, Theor. Comput. Sci..

[6]  Roded Sharan,et al.  A 1.5-approximation algorithm for sorting by transpositions and transreversals , 2004, J. Comput. Syst. Sci..

[7]  David Alan Christie,et al.  Genome rearrangement problems , 1998 .

[8]  Tzvika Hartman,et al.  A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions , 2003, CPM.

[9]  Vineet Bafna,et al.  Sorting by Transpositions , 1998, SIAM J. Discret. Math..

[10]  Tzvika Hartman,et al.  A 1.375-Approximation Algorithm for Sorting by Transpositions , 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[11]  Pavel A. Pevzner,et al.  Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.

[12]  João Meidanis,et al.  Reversal and transposition distance of linear chromosomes , 1998, Proceedings. String Processing and Information Retrieval: A South American Symposium (Cat. No.98EX207).

[13]  Alberto Caprara,et al.  Sorting by reversals is difficult , 1997, RECOMB '97.

[14]  Guohui Lin,et al.  Signed genome rearrangement by reversals and transpositions: models and approximations , 2001, Theor. Comput. Sci..

[15]  Shietung Peng,et al.  A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions , 1999, Theor. Comput. Sci..

[16]  Alberto Caprara,et al.  Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals , 2002, J. Comb. Optim..

[17]  Guohui Lin,et al.  Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations , 1999, COCOON.

[18]  David A. Christie,et al.  A 3/2-approximation algorithm for sorting by reversals , 1998, SODA '98.

[19]  Jeffrey D. Palmer,et al.  Structural rearrangements, including parallel inversions, within the chloroplast genome of Anemone and related genera , 1994, Journal of Molecular Evolution.

[20]  Vineet Bafna,et al.  Genome Rearrangements and Sorting by Reversals , 1996, SIAM J. Comput..

[21]  D. Sankoff,et al.  Parametric genome rearrangement. , 1996, Gene.