On computing the breakpoint reuse rate in rearrangement scenarios

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5267 LNBI, Issue , 2008, Pages 226-240

  Bergeron, Anne ^a   Mixtacki, Julia ^b   Stoye, Jens ^b  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^b BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BREAKPOINT; CLASSICAL SET; CURRENT DEFINITION; FORMAL PROPERTIES; GENOME REARRANGEMENTS; HUMAN GENOMES; MAMMALIAN GENOMES; MOUSE GENOME; NEW APPROACHES;

MAMMALS;

GENES;

EID: 70350536712     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87989-3_17     Document Type: Conference Paper

References (16)

1. Alekseyev, M., Pevzner, P.A.: Are there rearrangement hotspots in the human genome? PLoS Comput. Biol. 3(11), e209 (2007)
2. Bafna, V., Pevzner, P.: Genome rearrangements and sorting by reversals. SIAM J. Computing 25(2), 272-289 (1996)
3. Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 163-173. Springer, Heidelberg (2006)
4. Bergeron, A.,Mixtacki, J., Stoye, J.: HP distance via Double Cut and Join distance. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 56-68. Springer, Heidelberg (2008)
5. Hannenhalli, S., Pevzner, P.A.: Transforming men into mice (polynomial algorithm for genomic distance problem). In: Proceedings of FOCS 1995, pp. 581-592 (1995)
6. Jean, G., Nikolski, M.: Genome rearrangements: a correct algorithm for optimal capping. Inf. Process. Lett. 104(1), 14-20 (2007)
7. Kececioglu, J.D., Sankoff, D.: Exact and approximation algorithms for sorting by reversals with application to genome rearrangement. Algorithmica 13(1/2), 180-210 (1995)
8. Ozery-Flato, M., Shamir, R.: Two notes on genome rearrangements. J. Bioinf. Comput. Biol. 1(1), 71-94 (2003)
9. Pevzner, P., Tesler, G.: Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proc. Natl. Acad. Sci. USA 100(13), 7672-7677 (2003)
10. Pevzner, P., Tesler, G.: Transforming men into mice: The Nadeau-Taylor chromosomal breakage model revisited. In: Proceedings of RECOMB 2003, pp. 247-256 (2003)
11. Sankoff, D.: Edit distances for genome comparison based on non-local operations. In: Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.) CPM 1992. LNCS, vol. 644, pp. 121-135. Springer, Heidelberg (1992)
12. Sankoff, D., Trinh, P.: Chromosomal breakpoint reuse in genome sequence rearrangement. J. Comput. Biol. 12(6), 812-821 (2005)
13. Sturtevant, A.H.: A crossover reducer in Drosophila melanogaster due to inversion of a section of the third chromosome. Biologisches Zentralblatt 46(12), 697-702 (1926)
14. Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci. 65(3), 587-609 (2002)
15. Tesler, G.: GRIMM: Genome rearrangements web server. Bioinformatics 18(3), 492-493 (2002)
16. Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21(16), 3340-3346 (2005)