Abstract
Given the gene-order of a set of contemporary genomes, the problem of recovering the rearrangement scenario that best explains these arrangements can be challenging even if the phylogeny of these species is known. Most of the existing methods can identify an optimal or near-optimal scenario in terms of parsimony but they cannot distinguish between reliable and putative events on the reconstructed tree. In this paper, we propose an efficient method to infer partial rearrangement scenarios consisting of only reliable ancestral events. Using simulations, we show that the approach allows the recovery of actual events with high sensitivity and specificity under both random and fragile rearrangement models. Finally, we also apply the approach to two real data sets.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM Journal on Discrete Mathematics 11(2), 224–240 (1998)
Bourque, G., Pevzner, P.A.: Genome-scale evolution: reconstructing gene orders in the ancestral species. Genome Res. 12, 26–36 (2002)
Bourque, G., Tesler, G., Pevzner, P.A: The convergence of cytogenetics and rearrangement-based models for ancestral genome reconstruction. Genome Res. 16(3), 311–313 (2006)
Bourque, G., Zdobnov, E.M., Bork, P., Pevzner, P.A., Tesler, G.: Comparative architectures of mammalian and chicken genomes reveal highly variable rates of genomic rearrangements across different lineages. Genome Res. 15(1), 98–110 (2005)
Caprara, A.: Formulations and complexity of multiple sorting by reversals. In: RECOMB 99, pp. 84–93 (1999)
Cosner, M., Jansen, R., Moret, B., Raubeson, L., Wang, L., Warnow, T., Wyman, S.: A new fast heuristic for computing the breakpoint phylogeny and experimental phylogenetic analyses of real and synthetic data. In: ISMB00, pp. 104–115 (2000)
Froenicke, L., Caldes, M.G., Graphodatsky, A., Muller, S., Lyons, L.A, Robinson, T.J, Volleth, M., Yang, F., Wienberg, J.: Are molecular cytogenetics and bioinformatics suggesting diverging models of ancestral mammalian genomes?. Genome Res. 16(3), 306–310 (2006)
Hannenhalli, S., Chappey, C., Koonin, E., Pevzner, P.: Genome sequence comparison and scenarios for gene rearrangements: A test case. Genomics 30, 299–311 (1995)
Larget, B., Simon, D., Kadane, J., Sweet, D.: A bayesian analysis of metazoan mitochondrial genome arrangements. Mol. Biol. Evol. 22(3), 486–495 (2005)
Lin, C.H., Bourque, G., Tan, P.: Comparative analysis of Burkholderia species reveals an association between large-scale and fine-scale divergence in prokaryotes. In: preparation (2007)
Ma, J., Zhang, L., Suh, B.B., Raney, B.J., Burhans, R.C, Kent, W J., Blanchette, M., Haussler, D., Miller, W.: Reconstructing contiguous regions of an ancestral genome. Genome Res. 16(12), 1557–1565 (2006)
Miklos, I.: MCMC genome rearrangement. Bioinformatics 19(90002), 130ii–137 (2003)
Moret, B.M.E., Wyman, S., Bader, D.A., Warnow, T., Yan, M.: A new implementation and detailed study of breakpoint analysis. In: PSB 2001, pp. 583–594 (2001)
Murphy, W.J., Larkin, D.M., van der Wind, A.E.-, Bourque, G.: Dynamics of mammalian chromosome evolution inferred from multispecies comparative maps. Science 309(5734), 613–617 (2005)
Peng, Q., Pevzner, P.A, Tesler, G.: The fragile breakage versus random breakage models of chromosome evolution. PLoS Comput. Biol. 2(2), 14 (2006)
Pevzner, P., Tesler, G.: Human and mouse genomic sequences reveal extensive breakpoint reuse in mammalian evolution. Proc. Natl. Acad. Sci. U S A 100(13), 7672–7677 (2003)
Sankoff, D.: The signal in the genomes. PLoS Comput. Biol. 2(4), e35 (2006)
Sankoff, D., Leduc, G., Antoine, N., Paquin, B., Lang, B., Cedergren, R.: Gene order comparisons for phylogenetic inference: Evolution of the mitochondrial genome. Proceedings of the National Academy of Sciences USA 89, 6575–6579 (1992)
Sankoff, D., Trinh, P.: Chromosomal breakpoint reuse in genome sequence rearrangement. J. Comput. Biol. 12(6), 812–821 (2005)
Savva, G., Dicks, J.L., Roberts, I.N.: Current approaches to whole genome phylogenetic analysis. Briefings in Bioinformatics 4(1), 63–74 (2003)
Siepel, A.: An algorithm to find all sorting reversals. In: RECOMB02, pp. 281–290 (2002)
Tesler, G.: GRIMM: genome rearrangements web server. Bioinformatics 18(3), 492–493 (2002)
Walter, M., Dias, Z., Meidanis, J.: A new approach for approximating the transposition distance. In: De La Fuenta, P. (ed.) SPIRE, pp. 199–208. IEEE Computer Society Press, Los Alamitos (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, H., Bourque, G. (2007). Recovering True Rearrangement Events on Phylogenetic Trees. In: Tesler, G., Durand, D. (eds) Comparative Genomics. RECOMB-CG 2007. Lecture Notes in Computer Science(), vol 4751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74960-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-74960-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74959-2
Online ISBN: 978-3-540-74960-8
eBook Packages: Computer ScienceComputer Science (R0)