Paths and cycles in breakpoint graphs of random multichromosomal genomes

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

Volumn 4205 LNBI, Issue , 2006, Pages 51-62

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

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

BICOLOURED BREAKPOINT GRAPHS; INTERCHROMOSOMAL OPERATIONS; RANDOM GENE ORDER;

GENES;

EID: 33750350311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11864127_5     Document Type: Conference Paper

References (7)

1. Eriksen, N. and Hultman, A. 2004. Estimating the expected reversal distance after a fixed number of reversals. Advances of Applied Mathematics 32, 439-453.
2. Kim, J.H. and Wormald, N.C. 2001. Random matchings which induce Hamilton cycles, and Hamiltonian decompositions of random regular graphs, Journal of Combinatorial Theory, Series B 81, 20-44.
3. Mazowita, M., Haque, L. and Sankoff, D. 2006. Stability of rearrangement measures in the comparison of genome sequences. Journal of Computational Biology 13, 554-566.
4. Sankoff, D. 2006. The signal in the genomes. PLoS Computational Biology 2, e35.
5. Sankoff, D. and Haque, L. 2006. The distribution of genomic distance between random genomes. Journal of Computational Biology 13, 1005-1012.
6. Tesler, G. 2002. Efficient algorithms for multichromosomal genome rearrangements. Journal of Computer and System Sciences 65, 587-609.
7. Yancopoulos, S., Attie, O. and Friedberg, R. 2005. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340-3346