Counting phylogenetic networks with few reticulation vertices: galled and reticulation-visible networks

DOI10.1007/s11538-024-01309-wzbMATH Open1542.92089MaRDI QIDQ6564779

Michael Fuchs, Yu-Sheng Chang

Publication date: 1 July 2024

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

zbMATH Keywords

enumerationphylogenetic networkreticulation-visible networkgalled networkcomponent graph method

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Systems biology, networks (92C42)

Cites Work

• Unnamed Item
• Reticulation-visible networks
• A decomposition theorem and two algorithms for reticulation-visible networks
• Asymptotic enumeration and distributional properties of galled networks
• Classes of explicit phylogenetic networks and their biological and mathematical significance
• Counting phylogenetic networks with few reticulation vertices: a second approach
• Counting and enumerating galled networks
• Counting and enumerating tree-child networks and their subclasses
• On the asymptotic growth of the number of tree-child networks
• Properties of normal phylogenetic networks
• Locating a Tree in a Phylogenetic Network in Quadratic Time
• Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections
• Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
• Counting General Phylogenetic networks
• Enumerative and distributional results for \(d\)-combining tree-child networks

This page was built for publication: Counting phylogenetic networks with few reticulation vertices: galled and reticulation-visible networks