Bounding the Number of Hybridisation Events for a Consistent Evolutionary History
- 2 May 2005
- journal article
- research article
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 51 (2) , 171-182
- https://doi.org/10.1007/s00285-005-0315-9
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.Keywords
This publication has 16 references indexed in Scilit:
- Constructing Minimal Ancestral Recombination GraphsJournal of Computational Biology, 2005
- On the Computational Complexity of the Rooted Subtree Prune and Regraft DistanceAnnals of Combinatorics, 2005
- A Framework for Representing Reticulate EvolutionAnnals of Combinatorics, 2005
- On the minimum number of recombination events in the evolutionary history of DNA sequencesJournal of Mathematical Biology, 2004
- Neighbor-Net: An Agglomerative Method for the Construction of Phylogenetic NetworksMolecular Biology and Evolution, 2003
- Parsimonious Reconstruction of Sequence Evolution and Haplotype BlocksPublished by Springer Nature ,2003
- Subtree Transfer Operations and Their Induced Metrics on Evolutionary TreesAnnals of Combinatorics, 2001
- Perfect Phylogenetic Networks with RecombinationJournal of Computational Biology, 2001
- Gene Trees in Species TreesSystematic Biology, 1997
- Reconstructing evolution of sequences subject to recombination using parsimonyMathematical Biosciences, 1990