Journal of Mathematical Biology

, Volume 51, Issue 2, pp 171–182 | Cite as

Bounding the Number of Hybridisation Events for a Consistent Evolutionary History

  • Mihaela Baroni
  • Stefan GrünewaldEmail author
  • Vincent Moulton
  • Charles Semple


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.

Key words or phrases

Phylogenetic tree Phylogentic network Hybrid network Recombination Lateral gene transfer Hybridisation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Allen, B.L., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Ann. Comb. 5, 1–13 (2001)CrossRefGoogle Scholar
  2. 2.
    Baroni, M., Semple, C., Steel, M.: A framework for representing reticulate evolution. Ann. Comb. 8, 391–408 (2004)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Ann. Comb. 8, 409–423 (2004)CrossRefGoogle Scholar
  4. 4.
    Bryant, D., Moulton, V.: NeighborNet: an agglomerative algorithm for the construction of phylogenetic networks. Mol. Biol. Evol. 21 (2), 255–265 (2004)CrossRefGoogle Scholar
  5. 5.
    Felsenstein, J.: Inferring Phylogenies. Sinauer Associates, 2003Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Hein, J.: Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci. 98, 185–200 (1990)CrossRefPubMedGoogle Scholar
  8. 8.
    Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discrete Appl. Math. 71, 153–169 (1996)CrossRefGoogle Scholar
  9. 9.
    Maddison, W.: Gene trees in species trees. Syst. Biol. 46, 523–536 (1997)Google Scholar
  10. 10.
    Myers, S., Griffiths, R.: Bounds on the minimum number of recombination events in a sample history. Genetics 163, 375–394 (2003)PubMedGoogle Scholar
  11. 11.
    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–346Google Scholar
  12. 12.
    Posada, D., Crandall, K.: Intraspecific gene geneologies: trees grafting into networks. Trends Ecol. Evol. 16, 37–45 (2001)CrossRefPubMedGoogle Scholar
  13. 13.
    Semple, C., Steel, M.: Phylogenetics. Oxford University Press, 2003Google Scholar
  14. 14.
    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–302Google Scholar
  15. 15.
    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)CrossRefPubMedGoogle Scholar
  16. 16.
    Song, Y., Hein, J.: Constructing minimal ancestral recombination graphs. J. Comp. Biol. To appearGoogle Scholar
  17. 17.
    Wang, L., Zhang, K., Zhang, L.: Perfect phylogenetic networks with recombination. J. Comp. Biol. 8, 69–78 (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Mihaela Baroni
    • 1
  • Stefan Grünewald
    • 1
    Email author
  • Vincent Moulton
    • 2
  • Charles Semple
    • 1
  1. 1.Biomathematics Research Centre, Department of Mathematics and StatisticsUniversity of CanterburyChristchurchNew Zealand
  2. 2.School of Computing SciencesUniversity of East AngliaNorwichUK

Personalised recommendations