(1 + ε)-approximation of sorting by reversals and transpositions

Theoretical Computer Science

Volumn 289, Issue 1, 2002, Pages 517-529

  Eriksen, Niklas ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Approximation algorithm; Genome rearrangements; Permutations; Reversals; Sorting; Transpositions

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GENES; MOLECULAR BIOLOGY; PROBLEM SOLVING;

GENOME REARRANGEMENTS;

SORTING;

EID: 0037163953     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00338-3     Document Type: Article

References (15)

1. Bader D.A., Moret B.M.E., Yan M. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J. Comput. Biol. 8:2001;483-491.
2. V. Bafna, P. Pevzner, Genome rearrangements and sorting by reversals, Proc. 34th IEEE Symp. of the Foundations of Computer Science, 1994, pp. 148-157.
3. Bafna V., Pevzner P. Sorting by transpositions. SIAM J. Discrete Math. 11:1998;224-240.
4. A. Bergeron, A very elementary presentation of the Hannenhalli-Pevzner Theory, Proc. 12th Annu. Symp. on Combinatorial Pattern Matching, 2001, pp. 106-117.
5. P. Berman, S. Hannenhalli, Fast sorting by reversals, Proc. 7th Annu. Symp. on Combinatorial Pattern Matching, 1996, pp. 168-185.
6. P. Berman, S. Hannenhalli, M. Karpinki, 1.375-approximation algorithm for sorting by reversals, Electronic Colloquium for Computational Complexity TR01-047, 2001.
7. P. Berman, M. Karpinski, On some tighter inapproximability results, Proc. 26th Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 1644, Springer, Berlin, 1999, pp. 200-209.
8. Blanchette M., Kunisawa T., Sankoff D. Parametric genome rearrangement. Gene. 172:1996;GC11-17.
9. Caprara A. Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J. Discrete Math. 12:1999;91-110.
10. D.A. Christie, Genome rearrangement problems, Ph.D. Thesis, 1998.
11. N. Eriksen, D. Dalevi, S.G.E. Andersson, K. Eriksson, Gene order rearrangements with Derange: weights and reliability, preprint.
12. Gu Q.-P., Peng S., Sudborough H. A 2-approximation algorithm for genome rearrangements by reversals and transpositions. Theoret. Comput. Sci. 210:1999;327-339.
13. S. Hannenhalli, P. Pevzner, Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations with reversals), Proc. 27th Annu. ACM Symp. on the Theory of Computing, 1995, pp. 178-189.
14. H. Kaplan, R. Shamir, R.E. Tarjan, Faster and simpler algorithm for sorting signed permutations by reversals, Proc. 8th Annu. ACM-SIAM Symp. on Discrete Mathematics, 1997, pp. 344-351.
15. Palmer J.D., Herbon L.A. Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence. J. Molecular Evolution. 28:1988;87-97.