Sorting by weighted reversals, transpositions, and inverted transpositions

Journal of Computational Biology

Volumn 14, Issue 5, 2007, Pages 615-636

  Bader, Martin ^a   Ohlebusch, Enno ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

Approximation algorithm; Genome rearrangements; Weighted reversals and transpositions

Indexed keywords

CHROMOSOME ANALYSIS; CHROMOSOME INVERSION; CONFERENCE PAPER; GENE REARRANGEMENT; GENE SEQUENCE; INVERTED TRANSPOSITION; MATHEMATICAL ANALYSIS; MOLECULAR EVOLUTION; NONHUMAN; PRIORITY JOURNAL; REVERSAL REACTION;

ALGORITHMS; DNA TRANSPOSABLE ELEMENTS; DNA, CIRCULAR; GENE REARRANGEMENT; GENOME; GENOMICS; INVERSION, CHROMOSOME; MODELS, GENETIC; SYSTEMS BIOLOGY;

BACTERIA (MICROORGANISMS);

EID: 34447282827     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2007.R006     Document Type: Conference Paper

References (28)

1. Bader, D.A., Moret, B.M.E., and Yan, M. 2001. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J. Comput. Biol. 8, 483-491.
2. Bafna, V., and Pevzner, P.A. 1996. Genome rearrangements and sorting by reversals. SIAM J. Comput. 25, 272-289.
3. Bafna, V., and Pevzner, P.A. 1998. Sorting by transpositions. SIAM J. Discrete Math. 11, 224-240.
4. Bender, M.A., Ge, D., He, S., et al. 2004. Improved bounds on sorting with length-weighted reversals. ACM-SIAM Symp. Discrete Algorithms, 912-921.
5. Bergeron, A. 2005. A very elementary presentation of the Hannenhalli-Pevzner theory. Discrete Appl. Math. 146, 134-145.
6. Bergeron, A., Mixtacki, J., and Stoye, J. 2004. Reversal distance without hurdles and fortresses. Lect. Notes Comput. Sci. 3109, 388-399.
7. Bergeron, A., Mixtacki, J., and Stoye, J. 2006. A unifying view of genome rearrangements. Lect. Notes Comput. Sci. 4175, 163-173.
8. Berman, P., Hannenhalli, S., and Karpinski, M. 2002. 1.375-approximation algorithm for sorting by reversals. Lect. Notes Comput. Sci. 2461, 200-210.
9. Blanchette, M., Kunisawa, T., and Sankoff, D. 1996. Parametric genome rearrangement. Gene 172, GC11-GC17.
10. Caprara, A. 1999. Sorting permutations by reversals and Eulerian cycle decompositions. SIAM J. Discrete Math. 12, 91-110.
11. Christie, D.A. 1998. Genome rearrangement problems [Ph.D. dissertation]. University of Glasgow, Glasgow, UK.
12. El-Mabrouk, N. 2001. Sorting signed permutations by reversals and insertions/deletions of contiguous segments. J. Discr. Algorithms 1, 105-122.
13. El-Mabrouk, N. 2002. Reconstructing an ancestral genome using minimum segments duplications and reversals. J. Comput. Syst. Sci. 65, 442-464.
14. Elias, I., and Hartman, T. 2005. A 1.375-approximation algorithm for sorting by transpositions. Lect. Notes Bioinform. 3692, 204-215.
15. Eriksen, N. 2002. (1 + ε)-approximation of sorting by reversals and transpositions. Theor. Comput. Sci. 289, 517-529.
16. Gu, Q.-P, Peng, S., and Sudborough, H. 1999. A 2-approximation algorithms for genome rearrangements by reversals and transpositions. Theor. Comput. Sci. 210, 327-339.
17. Hannenhalli, S., and Pevzner, P.A. 1995. Transforming men into mice (polynomial algorithm for genetic distance problem). Found. Comput. Sci., 581-592.
18. Hannenhalli, S., and Pevzner, P.A. 1999. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46, 1-27.
19. Hartman, T., and Shamir, R. 2006. A simpler and faster 1.5-approximation algorithm for sorting by transpositions. Inf. Comput. 204, 275-290.
20. Hartman, T., and Sharan, R. 2005. A 1.5-approximation algorithm for sorting by transpositions and transreversals. J. Comput. Syst. Sci. 70, 300-320.
21. Lin, G.-H., and Xue, G. 2001. Signed genome rearrangement by reversals and transpositions: models and approximations. Theor. Comput. Sci. 259, 513-531.
22. Ozery-Flato, M., and Shamir, R. 2003. Two notes on genome rearrangements. J. Bioinform. Comput. Biol. 1, 71-94.
23. Pinter, R.Y., and Skiena, S. 2002. Genomic sorting with length-weighted reversals. Genome Inform. 13, 103-111.
24. Sankoff, D. 1999. Genome rearrangement with gene families. Bioinformatics 15, 909-917.
25. Setubal, J.C., and Meidanis, J. 1997. Introduction to Computational Molecular Biology. PWS Publishing Company, New York.
26. Tannier, E., and Sagot, M.-F. 2004. Sorting by reversals in subquadratic time. Lect. Notes Comput. Sci. 3109, 1-13.
27. Walter, M.E.M.T, Dias, Z., and Meidanis, J. 1998. Reversal and transposition distance of linear chromosomes. String Process. Inform. Retrieval, 96-102.
28. Yancopoulos, S., Attie, O., and Friedberg, R. 2005. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340-3346.