Chromosomal breakpoint reuse in genome sequence rearrangement.
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler bypass gene finding and ortholog identification and use the order of homologous blocks of unannotated sequence as input. The method excludes blocks shorter than a threshold length. Here we investigate possible biases introduced by eliminating short blocks, focusing on the notion of breakpoint reuse introduced by these authors. Analytic and simulation methods show that reuse is very sensitive to the proportion of blocks excluded. As is pertinent to the comparison of mammalian genomes, this exclusion risks randomizing the comparison partially or entirely.
Sankoff
David
D
Department of Mathematics and Statistics, University of Ottawa, 585 King Edward Avenue, Ottawa, Ontario, Canada K1N 6N5. sankoff@uottawa.ca
Trinh
Phil
P
D000465:Algorithms; D019457:Chromosome Breakage; D002875:Chromosomes; D003198:Computer Simulation; D015321:Gene Rearrangement; D016678:Genome; D010802:Phylogeny; D016415:Sequence Alignment