Enumerative combinatorics of unlabeled and labeled time-consistent galled trees
Authors:
Preprint
Abstract
In mathematical phylogenetics, the time-consistent galled trees provide a simple class of rooted binary network structures that can be used to represent a variety of different biological phenomena. We study the enumerative combinatorics of unlabeled and labeled time-consistent galled trees. We present a new derivation via the symbolic method of the number of unlabeled time-consistent galled trees with a fixed number of leaves and a fixed number of galls. We also derive new generating functions and asymptotics for labeled time-consistent galled trees.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Asymptotic Enumeration of Normal and Hybridization Networks via Tree DecorationBulletin of Mathematical Biology, 2025
- Sackin indices for labeled and unlabeled classes of galled treesJournal of Mathematical Biology, 2025
- Counting Phylogenetic Networks with Few Reticulation Vertices: Galled and Reticulation-Visible NetworksBulletin of Mathematical Biology, 2024
- Enumeration of Rooted Binary Unlabeled Galled TreesBulletin of Mathematical Biology, 2024
- Counting phylogenetic networks with few reticulation vertices: A second approachDiscrete Applied Mathematics, 2022
- Classes of explicit phylogenetic networks and their biological and mathematical significanceJournal of Mathematical Biology, 2022
- Combinatorial and stochastic properties of ranked tree‐child networksRandom Structures & Algorithms, 2021
- On the asymptotic growth of the number of tree-child networksEuropean Journal of Combinatorics, 2021
- Counting phylogenetic networks of level 1 and 2Journal of Mathematical Biology, 2020
- Counting and enumerating galled networksDiscrete Applied Mathematics, 2020