A statistically fair comparison of ancestral genome reconstructions, based on breakpoint and rearrangement distances.
We introduce a way of evaluating two mathematically different optimization approaches to the same problem, namely how good or bad each is with respect to the other's criterion. We illustrate this in a comparison of breakpoint and rearrangement distances between the endpoints of a branch, where total branch-length is minimized in reconstructing ancestral genomes at the nodes of a given phylogeny. We apply this to mammalian genome evolution and simulations under various hypotheses about breakpoint re-use. Reconstructions based on rearrangement distance are superior in terms of branch length and dispersion of the multiple optimal reconstructions, but simulations show that both sets of reconstructions are equally close to the simulated ancestors.
Adam
Zaky
Z
School of Information Technology and Engineering, University of Ottawa, 585 King Edward Avenue, Ottawa, Ontario, Canada.
Sankoff
David
D
D000465:Algorithms; D000818:Animals; D019295:Computational Biology / Q000379:methods*; D019143:Evolution, Molecular; D015321:Gene Rearrangement; D016678:Genome; D006801:Humans; D008433:Mathematics; D008957:Models, Genetic; D010802:Phylogeny