Properties of Normal Phylogenetic Networks
- 30 September 2009
- journal article
- Published by Springer Nature in Bulletin of Mathematical Biology
- Vol. 72 (2) , 340-358
Abstract
A phylogenetic network is a rooted acyclic digraph with vertices corresponding to taxa. Let X denote a set of vertices containing the root, the leaves, and all vertices of outdegree 1. Regard X as the set of vertices on which measurements such as DNA can be made. A vertex is called normal if it has one parent, and hybrid if it has more than one parent. The network is called normal if it has no redundant arcs and also from every vertex there is a directed path to a member of X such that all vertices after the first are normal. This paper studies properties of normal networks. Under a simple model of inheritance that allows homoplasies only at hybrid vertices, there is essentially unique determination of the genomes at all vertices by the genomes at members of X if and only if the network is normal. This model is a limiting case of more standard models of inheritance when the substitution rate is sufficiently low. Various mathematical properties of normal networks are described. These properties include that the number of vertices grows at most quadratically with the number of leaves and that the number of hybrid vertices grows at most linearly with the number of leaves.Keywords
This publication has 22 references indexed in Scilit:
- A distance metric for a class of tree-sibling phylogenetic networksBioinformatics, 2008
- Reconstruction of certain phylogenetic networks from the genomes at their leavesJournal of Theoretical Biology, 2008
- Computing the minimum number of hybridization events for a consistent evolutionary historyDiscrete Applied Mathematics, 2007
- Efficient parsimony-based methods for phylogenetic network reconstructionBioinformatics, 2007
- Maximum likelihood of phylogenetic networksBioinformatics, 2006
- Phylogenetic networks: modeling, reconstructibility, and accuracyIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
- Perfect Phylogenetic Networks with RecombinationJournal of Computational Biology, 2001
- Split decomposition: A new and useful approach to phylogenetic analysis of distance dataMolecular Phylogenetics and Evolution, 1992
- Reconstructing evolution of sequences subject to recombination using parsimonyMathematical Biosciences, 1990
- A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequencesJournal of Molecular Evolution, 1980