Counting Tree-Child Networks and Their Subclasses

2019/08/06 by Cardona, Gabriel, Zhang, Louxin · 1 citation
Agricultural and Biological Sciences · Biochemistry, Genetics and Molecular Biology · #05C30 #FOS: Biological sciences #J.3 #Plant Diversity and Evolution #Plant and Fungal Species Descriptions #Plant and animal studies #Populations and Evolution (q-bio.PE)

paper · pdf · doi:10.48550/arxiv.1908.01917

openalex publication_date 2019/08/06 · openalex created_date 2019/08/13 · openalex updated_date 2026/07/28

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.

Citations

• Counting and Enumerating Galled Networks

Cited by

• Counting General Phylogenetic networks

Related

• Counting and Enumerating Galled Networks
• Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
• Counting Phylogenetic Networks with Few Reticulation Vertices: Galled and Reticulation-Visible Networks
• A Short Note on the Exact Counting of Tree-Child Networks
• Counting Phylogenetic Networks with Few Reticulation Vertices: A Second Approach