Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks

zbMath1411.05240arXiv1803.11325MaRDI QIDQ5377037

Michael Fuchs, Bernhard Gittenberger, Marefatollah Mansouri

Publication date: 23 May 2019

Full work available at URL: https://arxiv.org/abs/1803.11325

zbMATH Keywords

evolutionary processes modeling

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items (14)

Asymptotic enumeration and distributional properties of galled networks ⋮ Bijections for ranked tree-child networks ⋮ Counting General Phylogenetic networks ⋮ Counting phylogenetic networks with few reticulation vertices: a second approach ⋮ A branching process approach to level‐k phylogenetic networks ⋮ Combinatorial and stochastic properties of ranked tree‐child networks ⋮ Counting and enumerating galled networks ⋮ Enumeration of rooted binary unlabeled galled trees ⋮ Counting and enumerating tree-child networks and their subclasses ⋮ Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections ⋮ Counting phylogenetic networks of level 1 and 2 ⋮ On the asymptotic growth of the number of tree-child networks ⋮ Enumerative and distributional results for \(d\)-combining tree-child networks ⋮ Counting phylogenetic networks with few reticulation vertices: galled and reticulation-visible networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Phylogenetic networks with every embedded phylogenetic tree a base tree
• Reticulation-visible networks
• Kernelizations for the hybridization number problem on multiple nonbinary trees
• Determining phylogenetic networks from inter-taxa distances
• Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
• Phylogenetic networks that display a tree twice
• Size of a phylogenetic network
• The asymptotic number of acyclic digraphs. I
• The asymptotic number of acyclic digraphs. II
• Enumerating phylogenetic trees with multiple labels
• The average height of binary trees and other simple trees
• On the number of labeled acyclic digraphs
• Generating functions for multi-labeled trees
• Counting phylogenetic networks
• Tree-like reticulation networks -- when do tree-like distances also support reticulate evolution?
• Properties of normal phylogenetic networks
• Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks
• Combinatorial Scoring of Phylogenetic Networks
• Counting Trees in a Phylogenetic Network Is \#P-Complete
• On the number of vertices of each rank in phylogenetic trees and their generalizations
• Isomorphism and Symmetries in Random Phylogenetic Trees
• On the shape of a random acyclic digraph
• Singularity Analysis of Generating Functions
• Register Allocation for Unary–Binary Trees
• On the Number of Maximal Vertices of a Random Acyclic Digraph

This page was built for publication: Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks