Abstract: The class of ranked tree-child networks, tree-child networks arising from an evolution process with a fixed embedding into the plane, has recently been introduced by Bienvenu, Lambert, and Steel. These authors derived counting results for this class. In this note, we will give bijective proofs of three of their results. Two of our bijections answer questions raised in their paper.
Recommendations
- Counting and enumerating tree-child networks and their subclasses
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- Counting phylogenetic networks
- Counting phylogenetic networks with few reticulation vertices: a second approach
- Counting general phylogenetic networks
Cites work
- Asymptotic enumeration and distributional properties of galled networks
- Combinatorial and stochastic properties of ranked tree‐child networks
- Counting phylogenetic networks
- Counting phylogenetic networks of level 1 and 2
- Counting phylogenetic networks with few reticulation vertices: a second approach
- Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- On the asymptotic growth of the number of tree-child networks
- Phylogeny. Discrete and random processes in evolution
Cited in
(4)
This page was built for publication: Bijections for ranked tree-child networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144491)
