The distance between randomly constructed genomes

Series on Advances in Bioinformatics and Computational Biology

Volumn 5, Issue , 2007, Pages 227-236

  Xu, Wei ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; GENES;

BREAKPOINT GRAPHS; GENOMIC DISTANCE; LINEAR CHROMOSOME; NUMBER OF CYCLES;

PROBABILITY DISTRIBUTIONS;

EID: 84863393349     PISSN: 17516404     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1142/9781860947995_0025     Document Type: Conference Paper

References (6)

1. Sankoff, D. and Haque, L. 2006. The distribution of genomic distance between random genomes. Journal of Computational Biology 13, 1005-1012.
2. Xu, W., Zheng, C. and Sankoff, D. 2006. Paths and cycles in breakpoint graphs of random multichromosomal genomes. Proceedings of RECOMB Satellite Conference on Comparative Genomics 2006, G. Bourque and N. El-Mabrouk, eds., Lecture Notes in Computer Science 4205. Heidelberg: Springer, 51-62.
3. Yancopoulos, S., Attie, O. and Friedberg, R. 2005. Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340-3346
4. 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.
5. Hannenhalli, S. and Pevzner, P.A. 1995. Transforming men into mice (polynomial algorithm for genomic distance problem. Proceedings of the IEEE 36th Annual Symposium on Foundations of Computer Science. 581-92.
6. Tesler, G. 2002. Efficient algorithms for multichromosomal genome rearrangements. Journal of Computer and System Sciences 65, 587-609.