Paths and cycles in breakpoint graph of random multichromosomal genomes

Journal of Computational Biology

Volumn 14, Issue 4, 2007, Pages 423-435

  Xu, Wei ^a   Zheng, Chunfang ^a   Sankoff, David ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Circular chromosomes; Genome rearrangement; Inversion translocation ratio; Kim Wormald theorem; Random graphs

Indexed keywords

ALGORITHM; CHROMOSOME ANALYSIS; CHROMOSOME INVERSION; CHROMOSOME NUMBER; CHROMOSOME STRUCTURE; CHROMOSOME TRANSLOCATION; CONFERENCE PAPER; GENE ORDER; GENE REARRANGEMENT; GENOME ANALYSIS; HUMAN; MATHEMATICAL ANALYSIS; NONHUMAN; PLASTID; PRIORITY JOURNAL; PROBABILITY; SIMULATION; STOCHASTIC MODEL;

CHROMOSOMES; GENE REARRANGEMENT; GENOME; MODELS, GENETIC; PLASMIDS;

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

References (17)

1. Billingsley, P. 1995. Probability and Measure, 3rd ed. Wiley-Interscience, New York.
2. Eriksen, N., and Hultman, A. 2004. Estimating the expected reversal distance after a fixed number of reversals. Adv. Appl. Math. 32, 439-453.
3. Friedberg, R. 2006. Personal communication.
4. Hannenhalli, S., and Pevzner, P.A. 1995a. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Proc. 27th Annu. ACM Symp. Theory Comput., 178-189.
5. Hannenhalli, S., and Pevzner, P.A. 1995b. Transforming men into mice (polynomial algorithm for genomic distance problem. Proc. 36th Annu. IEEE Symp. Found. Comput. Sci. 581-592,
6. Kececioglu, J., and Sankoff, D. 1994. Efficient bounds for oriented chromosome inversion distance. Lect. Notes Comput. Sci. 807, 307-325.
7. Kim, J.H., and Wormald, N.C. 2001. Random matchings which induce Hamilton cycles, and Hamiltonian decompositions of random regular graphs. J. Combin. Theory. Ser. B 81, 20-44.
8. Mazowita, M., Haque, L., and Sankoff, D. 2006. Stability of rearrangement measures in the comparison of genome sequences. J. Comput. Biol. 13, 554-566.
9. Sankoff, D. 1989. Mechanisms of genome evolution: models and inference. Bull. Int. Statist. Inst. 47, 461-475.
10. Sankoff, D. 1992. Edit distance for genome comparison based on non-local operations. Lect. Notes Comput. Sci. 644, 121-135.
11. Sankoff, D. 2006. The signal in the genomes. PLoS Comput. Biol. 2, e35.
12. Sankoff, D., and Haque, L. 2006. The distribution of genomic distance between random genomes. J. Comput. Biol. 13, 1005-1012.
13. Tesler, G. 2002. Efficient algorithms for multichromosomal genome rearrangements. J. Comput. Syst. Sci. 65, 587-609.
14. Waterston, G., Ewens, W., Hall, T., et al. 1982. The chromosome inversion problem. J. Theoret. Biol. 99, 1-7.
15. Xu, W. 2007. The distance between randomly constructed genomes (submitted).
16. Yancopoulos, S., Attie, O., and Friedberg, R. 2005. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340-3346.
17. Young, R.M. 1991. Euler's constant. Math. Gazette 75, 187-190.