Counting phylogenetic networks with few reticulation vertices: a second approach
From MaRDI portal
Publication:2166221
DOI10.1016/j.dam.2022.03.026zbMath1498.92131arXiv2104.07842OpenAlexW3156174818MaRDI QIDQ2166221
Michael Fuchs, En-Yu Huang, Guan-Ru Yu
Publication date: 24 August 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.07842
Laplace methodphylogenetic networkstree-child networksmultiplicative constantasymptotic countingnormal networks
Related Items (3)
Asymptotic enumeration and distributional properties of galled networks ⋮ Bijections for ranked tree-child networks ⋮ Enumeration of rooted binary unlabeled galled trees
Cites Work
- Asymptotic enumeration and distributional properties of galled networks
- Counting and enumerating tree-child networks and their subclasses
- Counting phylogenetic networks of level 1 and 2
- On the asymptotic growth of the number of tree-child networks
- Counting phylogenetic networks
- Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- A branching process approach to level‐k phylogenetic networks
- Combinatorial and stochastic properties of ranked tree‐child networks
This page was built for publication: Counting phylogenetic networks with few reticulation vertices: a second approach
