Back to Search
Start Over
Counting Phylogenetic Networks with Few Reticulation Vertices: Galled and Reticulation-Visible Networks
- 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.<br />Comment: Revised version; accepted for publication in Bull. Math. Biol
- Subjects :
- Mathematics - Combinatorics
05A15, 92B05
Subjects
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2401.08958
- Document Type :
- Working Paper