Exact and asymptotic enumeration of unrestricted binary phylogenetic networks through automorphism weights
math.CO, q-bio.PE
Submitted: 2026-10-02
Updated: 2026-10-02
Sources
- Exact Enumeration of Phylogenetic Networks: The Tree-Child, Reticulation-Visible and Orchard Hierarchy
- Proof of a Conjecture on Young Tableaux with Walls
- Exact Counts of Binary Phylogenetic Networks with Four Reticulations
- Asymptotic Counting of Binary Phylogenetic Networks
Related papers
- Exponential random graph models with soft clique constraints
- Two Linear Programs are Better than One
- Exact Enumeration of Phylogenetic Networks: The Tree-Child, Reticulation-Visible and Orchard Hierarchy
- Arithmetic Circuits and Neural Networks for Regular Matroids
- On composition and decomposition operations for vector spaces, graphs and matroids
- Sedentary quantum walks on bipartite and planar graphs