Enumerative combinatorics of unlabeled and labeled time-consistent galled trees
- 1 June 2026
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1082
Abstract
No abstract availableAll Related Versions
Funding Information
- National Science Foundation (DMS-2450005)
- National Science and Technology Council (NSTC-113-2115-M-004-004-MY3)
This publication has 18 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