Abstract
We introduce a way of evaluating two mathematically independent 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, wehre 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adam, Z., Sankoff, D.: The ABCs of MGR with DCJ. Evolutionary Bioinformatics Journal 4, 69–74 (2008)
Bergeron, A., Mixtacki, J., Stoye, J.: A unifying view of genome rearrangements. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 163–173. Springer, Heidelberg (2006)
Bourque, G., Pevzner, P.: Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Research 12, 26–36 (2002)
Cosner, M., Jansen, R., Moret, B.M.E., Raubeson, L., Wang, L., et al.: An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanulaceae. In: Sankoff, D., Nadeau, J. (eds.) Comparative Genomics, pp. 99–121. Kluwer, Dordrecht (2001)
Lau, H.: A Java Library of Graph Algorithms and Optimization. Chapman, Boca Raton (2006)
Mikkelsen, T.S., Wakefield, M.J., Aken, B., Amemiya, C.T., Chang, J.L., et al.: Genome of the marsupial Monodelphis domestica reveals innovation in non-coding sequences. Nature 447, 167–177 (2007)
Moret, B.M.E., Siepel, A.C., Tang, J., Liu, T.: Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 521–536. Springer, Heidelberg (2002)
Moret, B.M.E., Wang, L., Warnow, T., Wyman, S.: New approaches for reconstructing phylogenies from gene order data. Bioinformatics 17(suppl.), 165–173 (2001)
Murphy, W.J., Larkin, D.M., Wind, A.E., Bourque, G., Tesler, G., et al.: Dynamics of mammalian chromosome evolution inferred from multispecies comparative maps. Science 309, 613–617 (2005)
Sankoff, D.: The signal in the genomes. PLOSÂ 2, e35 (2006)
Swenson, K.M., Marron, M., Earnest-DeYoung, J.V., Moret, B.M.E.: Approximating the true evolutionary distance between two genomes. In: Proc. 7th Workshop on Algorithm Engineering and Experiments (ALENEX 2005), pp. 121–129. SIAM, Philadelphia (2005)
Tannier, E., Zheng, C., Sankoff, D.: Multichromosomal median and halving problems under different genomic distances. BMC Bioinformatics 10, 120 (2009)
Yancopoulos, S., Attie, O., Friedberg, R.: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics 21, 3340–3346 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adam, Z., Sankoff, D. (2009). A Statistically Fair Comparison of Ancestral Genome Reconstructions, Based on Breakpoint and Rearrangement Distances. In: Ciccarelli, F.D., Miklós, I. (eds) Comparative Genomics. RECOMB-CG 2009. Lecture Notes in Computer Science(), vol 5817. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04744-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-04744-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04743-5
Online ISBN: 978-3-642-04744-2
eBook Packages: Computer ScienceComputer Science (R0)