Back to Search
Start Over
Counting Phylogenetic Networks with Few Reticulation Vertices: Galled and Reticulation-Visible Networks.
- Source :
- Bulletin of Mathematical Biology; Jul2024, Vol. 86 Issue 7, p1-23, 23p
- Publication Year :
- 2024
-
Abstract
- We give exact and asymptotic counting results for the number of galled networks and reticulation-visible networks with few reticulation vertices. Our results are obtained with the component graph method, which was introduced by L. Zhang and his coauthors, and generating function techniques. For galled networks, we in addition use analytic combinatorics. Moreover, in an appendix, we consider maximally reticulated reticulation-visible networks and derive their number, too. [ABSTRACT FROM AUTHOR]
- Subjects :
- GENERATING functions
COMBINATORICS
Subjects
Details
- Language :
- English
- ISSN :
- 00928240
- Volume :
- 86
- Issue :
- 7
- Database :
- Complementary Index
- Journal :
- Bulletin of Mathematical Biology
- Publication Type :
- Academic Journal
- Accession number :
- 177309630
- Full Text :
- https://doi.org/10.1007/s11538-024-01309-w