Enumeration of rooted binary perfect phylogenies
From MaRDI portal
Cites work
- An asymptotic expansion for the Wedderburn–Etherington sequence
- Analytic combinatorics
- Bayesian logistic regression using a perfect phylogeny
- Efficient algorithms for inferring evolutionary trees
- Enumeration of binary trees compatible with a perfect phylogeny
- Generating functions for multi-labeled trees
- scientific article; zbMATH DE number 3443655 (Why is no real title available?)
- Measuring tree balance using symmetry nodes -- a new balance index and its extremal properties
- Phylogeny. Discrete and random processes in evolution
- Random Trees
- ReCombinatorics. The algorithmics of ancestral recombination graphs and explicit phylogenetic networks. With contributions from Charles H. Langley, Yun S. Song and Yufeng Wu
- The Lichtenberg sequence
- The nonassociativity of the double minus operation
- The probabilities of rooted tree-shapes generated by random bifurcation
This page was built for publication: Enumeration of rooted binary perfect phylogenies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883350)