Sorting by reciprocal translocations via reversals theory

Journal of Computational Biology

Volumn 14, Issue 4, 2007, Pages 408-422

  Ozery Flato, Michal ^a   Shamir, Ron ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Genome rearrangement; Sorting by reversals; Sorting by translocations

Indexed keywords

ALGORITHM; CHROMOSOME ANALYSIS; CONFERENCE PAPER; GENE ORDER; GENE REARRANGEMENT; GENE SEQUENCE; GENE TRANSLOCATION; GENOME ANALYSIS; GENOMIC SORTING; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; SEQUENCE ANALYSIS; THEORY;

ALGORITHMS; CHROMOSOMES; COMPUTATIONAL BIOLOGY; GENOME; SEQUENCE ANALYSIS, DNA; TRANSLOCATION, GENETIC;

EID: 34250340516     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2007.A003     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. Bergeron, A. 2005. A very elementary presentation of the Hannenhalli-Pevzner theory. Discrete Appl. Math. 146, 134-145.
3. Bergeron, A., Mixtacki, J., and Stoye, J. 2006a. On sorting by translocations. J. Comput. Biol. 13, 567-578.
4. Bergeron, A., Mixtacki, J., and Stoye, J. 2006b. A unifying view of genome rearrangements. Lect. Notes Comput. Sci. 4175, 163-173.
5. Berman, P., and Hannenhalli, S. 1996. Fast sorting by reversal. Lect. Notes Comput. Sci. 1075, 168-185.
6. Bourque, G., and Pevzner, P.A. 2002. Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Res. 12, 26-36.
7. Bourque, G., Pevzner, P.A., and Tesler, G. 2004. Reconstructing the genomic architecture of ancestral mammals: lessons from human, mouse, and rat genomes. Genome Res. 14, 507-516.
8. Christie, D.A. 1996. Sorting permutaions by block interchanges. Inform. Process. Lett. 60, 165-169.
9. Hannenhalli, S. 1996. Polynomial algorithm for computing translocation distance between genomes. Discrete Appl. Math. 71, 137-151.
10. Hannenhalli, S., and Pevzner, P. 1995. Transforming men into mice (polynomial algorithm for genomic distance problems). 36th Annual Symposium on Foundations of Computer Science (FOCS'95), 581-592. IEEE Computer Society Press, Los Alamitos, CA.
11. Hannenhalli, S., and Pevzner, P. 1999. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM 46, 1-27.
12. Ishikawa, F., and Naito, T. 1999. Why do we have linear chromosomes? A matter of Adam and Eve. Mutation Res. DNA Repair 434, 99-107.
13. Kaplan, H., Shamir, R., and Tarjan, R.E. 2000. Faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Comput. 29, 880-892.
14. Kaplan, H., and Verbin, E. 2005. Sorting signed permutations by reversals, revisited. J. Comput. Syst. Sci. 70, 321-341.
15. Kececioglu, J.D., and Ravi, R. 1995. Of mice and men: Algorithms for evolutionary distances between genomes with translocation. Proc. 6th Annual Symposium on Discrete Algorithms, 604-613. ACM Press, New York.
16. Lin, Y.C., Lu, C.L., Chang, H.-Y., et al. 2005. An efficient algorithm for sorting by block-interchanges and its application to the evolution of vibrio species. J. Comput. Biol. 12, 102-112.
17. Murphy, W.J., Larkin, D.M., Everts van der Wind, A., et al. 2005. Dynamics of mammalian chromosome evolution inferred from multispecies comparative maps. Science 309, 613-617.
18. Nadeau, J.H., and Taylor, B.A. 1984. Lengths of chromosomal segments conserved since divergence of man and mouse. Proc. Natl. Acad. Sci. USA 81, 814-818.
19. Ozery-Flato, M., and Shamir, R. 2003. Two notes on genome rearrangements. J. Bioinformatics Comput. Biol. 1, 71-94.
20. 3/2 √log(n)) algorithm for sorting by reciprocal translocations. Lect. Notes Comput. Sci. 4009, 258-269.
21. Ozery-Flato, M., and Shamir, R. 2006b. Sorting by translocations via reversals theory. Lect. Notes Comput. Sci. 4205, 87-98.
22. Ozery-Flato, M., and Shamir, R. 2007. Rearrangements in genomes with centromeres. Part I: Translocations. In Proceedings of the 11th Annual International Conference on Computational Molecular Biology (RECOMB 2007), vol. 4453 of LNCS, Springer, 339-353.
23. Pevzner, P.A., and Tesler, G. 2003. Genome rearrangements in mammalian evolution: lessons from human and mouse genomes. Genome Res. 13, 37-45.
24. Sullivan, B.A., Blower, M.D., and Karpen, G.H. 2001. Determining centromere identity: cyclical stories and forking paths. Nat. Rev. Genet. 2, 584-596.
25. Tannier, E., Bergeron, A., and Sagot, M. 2007. Advances on sorting by reversals. Discrete Appl. Math. 155, 881-888.
26. Tesler, G. 2002a. Efficient algorithms for multichromosomal genome rearrangements. J. Comp. Sys. Sci. 65, 587-609.
27. Tesler, G. 2002b. GRIMM: genome rearrangements web server. Bioinformatics 18, 492-493.
28. Yancopoulos, S., Attie, O., and Friedberg, R. 2005. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340-3346.