Enumerative combinatorics of unlabeled and labeled time-consistent galled trees
From MaRDI portal
Cites work
- Analytic combinatorics
- Asymptotic enumeration and distributional properties of galled networks
- Asymptotic enumeration of normal and hybridization networks via tree decoration
- Asymptotic enumeration of rooted binary unlabeled galled trees with a fixed number of galls
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Combinatorial and stochastic properties of ranked tree‐child networks
- Counting and enumerating galled networks
- Counting and enumerating tree-child networks and their subclasses
- Counting general 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: galled and reticulation-visible networks
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- Enumeration of rooted binary unlabeled galled trees
- scientific article; zbMATH DE number 3492757 (Why is no real title available?)
- scientific article; zbMATH DE number 3497967 (Why is no real title available?)
- scientific article; zbMATH DE number 2124095 (Why is no real title available?)
- On the asymptotic growth of the number of tree-child networks
- Sackin indices for labeled and unlabeled classes of galled trees
- The number of trees
- The probabilities of rooted tree-shapes generated by random bifurcation
This page was built for publication: Enumerative combinatorics of unlabeled and labeled time-consistent galled trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7316924)
