The distribution of genomic distance between random genomes

Journal of Computational Biology

Volumn 13, Issue 5, 2006, Pages 1005-1012

  Sankoff, David ^a   Haque, Lani ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Breakpoint graph; Cycle size; Genomic rearrangements; Probability model; Random graph

Indexed keywords

ARTICLE; DECOMPOSITION; GENE REARRANGEMENT; GENETIC DISTANCE; HUMAN; HYPOTHESIS; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; PROBABILITY; RANDOM SAMPLE; STOCHASTIC MODEL;

COMPUTATIONAL BIOLOGY; GENE ORDER; GENOME; MODELS, GENETIC; PROBABILITY;

EID: 33745621902     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2006.13.1005     Document Type: Article

References (6)

1. Kececioglu, J., and Sankoff, D. 1994. Efficient bounds for oriented chromosome inversion distance. Lect. Notes Comput. Sci. 807, 307-325.
2. Kim, J.H., and Wormald, N.C. 2001. Random matchings which induce Hamilton cycles, and Hamiltonian decompositions of random regular graphs. J. Combin. Theor. B 81, 20-44.
3. Pevzner, P., and Tesler, G. 2003a. Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proc. Natl. Acad. Sci. USA 100, 7672-7677.
4. Pevzner, P.A., and Tesler, G. 2003b. Genome rearrangements in mammalian genomes: Lessons from human and mouse genomic sequences. Genome Res. 13, 37-45.
5. Sankoff, D., and Trinh, P. 2005. Chromosomal breakpoint re-use in genome sequence rearrangement. J. Comput. Biol. 12, 812-821.
6. Yancopoulos, S., Attie, O., and Friedberg, R. 2005. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340-3346.