Enumeration of rooted binary unlabeled galled trees
From MaRDI portal
Recommendations
- Counting and enumerating galled networks
- Counting and enumerating tree-child networks and their subclasses
- Asymptotic enumeration and distributional properties of galled networks
- Counting phylogenetic networks with few reticulation vertices: galled and reticulation-visible networks
- Computing the rooted triplet distance between galled trees by counting triangles
Cites work
- An asymptotic expansion for the Wedderburn–Etherington sequence
- Analytic combinatorics
- 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 phylogenetic networks of level 1 and 2
- Counting phylogenetic networks with few reticulation vertices: a second approach
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- Erratum: On an asymptotic method in enumeration
- scientific article; zbMATH DE number 2171552 (Why is no real title available?)
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- On an asymptotic method in enumeration
- On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
- Phylogeny. Discrete and random processes in evolution
- Random Trees
- The fine structure of galls in phylogenetic networks
- The probabilities of rooted tree-shapes generated by random bifurcation
Cited in
(4)- Asymptotic enumeration of rooted binary unlabeled galled trees with a fixed number of galls
- Sackin indices for labeled and unlabeled classes of galled trees
- Combinatorial comparison of general galled trees, time-consistent galled trees, and simplex time-consistent galled trees
- Enumerative combinatorics of unlabeled and labeled time-consistent galled trees
This page was built for publication: Enumeration of rooted binary unlabeled galled trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6124365)
