Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections
From MaRDI portal
Publication:5026978
zbMath1483.92104arXiv2006.15784MaRDI QIDQ5026978
Bernhard Gittenberger, Michael Fuchs, Marefatollah Mansouri
Publication date: 8 February 2022
Full work available at URL: https://arxiv.org/abs/2006.15784
Related Items (5)
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 ⋮ Generation of orchard and tree-child networks
Cites Work
- Unnamed Item
- Unnamed Item
- Counting and enumerating tree-child networks and their subclasses
- Properties of normal phylogenetic networks
- Unique determination of some homoplasies at hybridization events
- Phylogeny
- Comparing Trees with Pendant Vertices Labelled
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
This page was built for publication: Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections
