Counting Tree-Child Networks and Their Subclasses
arXiv:1908.01917
Abstract
Galled trees are studied as a recombination model in population genetics. This class of phylogenetic networks is generalized into tree-child, galled and reticulation-visible network classes by relaxing a structural condition imposed on galled trees. We count tree-child networks through enumerating their component graphs. Explicit counting formulas are also given for galled trees through their relationship to ordered trees, phylogenetic networks with few reticulations and phylogenetic networks in which the child of each reticulation is a leaf.
arXiv comment24 pages, 2 tables and 9 figures
References in corpus (5)
- Locating a Tree in a Phylogenetic Network in Quadratic Time
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- The compressions of reticulation-visible networks are tree-child
- Generation of Tree-Child phylogenetic networks
- Counting and Enumerating Galled Networks