Enumeration of rooted binary unlabeled galled trees
From MaRDI portal
Publication:6124365
DOI10.1007/s11538-024-01270-8OpenAlexW4393094723MaRDI QIDQ6124365
Shaili Mathur, Noah A. Rosenberg, Lily Agranat-Tamir
Publication date: 27 March 2024
Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11538-024-01270-8
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Erratum: On an asymptotic method in enumeration
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
- On an asymptotic method in enumeration
- Classes of explicit phylogenetic networks and their biological and mathematical significance
- Counting phylogenetic networks with few reticulation vertices: a second approach
- Counting and enumerating galled networks
- Counting and enumerating tree-child networks and their subclasses
- Counting phylogenetic networks of level 1 and 2
- On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees
- Phylogeny
- The Fine Structure of Galls in Phylogenetic Networks
- Random Trees
- An asymptotic expansion for the Wedderburn–Etherington sequence
- Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks
- The probabilities of rooted tree-shapes generated by random bifurcation
- Combinatorial and stochastic properties of ranked tree‐child networks
