Abstract.
Evolutionary processes such as hybridisation, lateral gene transfer, and recombination are all key factors in shaping the structure of genes and genomes. However, since such processes are not always best represented by trees, there is now considerable interest in using more general networks instead. For example, in recent studies it has been shown that networks can be used to provide lower bounds on the number of recombination events and also for the number of lateral gene transfers that took place in the evolutionary history of a set of molecular sequences. In this paper we describe the theoretical performance of some related bounds that result when merging pairs of trees into networks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Allen, B.L., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Ann. Comb. 5, 1–13 (2001)
Baroni, M., Semple, C., Steel, M.: A framework for representing reticulate evolution. Ann. Comb. 8, 391–408 (2004)
Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Ann. Comb. 8, 409–423 (2004)
Bryant, D., Moulton, V.: NeighborNet: an agglomerative algorithm for the construction of phylogenetic networks. Mol. Biol. Evol. 21 (2), 255–265 (2004)
Felsenstein, J.: Inferring Phylogenies. Sinauer Associates, 2003
Gusfield, D., Eddhu, S., Langley, C.: Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. Journal of Bioinformatics and Computational Biology 2 (1), 173–213 (2004)
Hein, J.: Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci. 98, 185–200 (1990)
Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discrete Appl. Math. 71, 153–169 (1996)
Maddison, W.: Gene trees in species trees. Syst. Biol. 46, 523–536 (1997)
Myers, S., Griffiths, R.: Bounds on the minimum number of recombination events in a sample history. Genetics 163, 375–394 (2003)
Nakhleh, L., Warnow, T., Randal Linder, C.: Reconstructing reticulate evolution in species - theory and practice. In: Proceedings of the 8th Annual International Conference on Research in Computational Molecular Biology (RECOMB), 2004, 337–346
Posada, D., Crandall, K.: Intraspecific gene geneologies: trees grafting into networks. Trends Ecol. Evol. 16, 37–45 (2001)
Semple, C., Steel, M.: Phylogenetics. Oxford University Press, 2003
Song, Y., Hein, J.: Parsimonious reconstruction of sequence evolution and haplotyde blocks: finding the minimum number of recombination events. In: G. Benson, R. Page, (eds.), Algorithms in Bioinformatics (WABI), vol. 2812, Lecture Notes in Bioinformatics, 2003, pp. 287–302
Song, Y., Hein, J.: On the minimum number of recombination events in the evolutionary history of DNA sequences. J. Math. Biol. 48, 160–186 (2004)
Song, Y., Hein, J.: Constructing minimal ancestral recombination graphs. J. Comp. Biol. To appear
Wang, L., Zhang, K., Zhang, L.: Perfect phylogenetic networks with recombination. J. Comp. Biol. 8, 69–78 (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Baroni, M., Grünewald, S., Moulton, V. et al. Bounding the Number of Hybridisation Events for a Consistent Evolutionary History. J. Math. Biol. 51, 171–182 (2005). https://doi.org/10.1007/s00285-005-0315-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00285-005-0315-9