Counting Phylogenetic Networks with Few Reticulation Vertices: Galled and Reticulation-Visible Networks
Combinatorics
2024-04-22 v2
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.
Keywords
Cite
@article{arxiv.2401.08958,
title = {Counting Phylogenetic Networks with Few Reticulation Vertices: Galled and Reticulation-Visible Networks},
author = {Yu-Sheng Chang and Michael Fuchs},
journal= {arXiv preprint arXiv:2401.08958},
year = {2024}
}
Comments
Revised version; accepted for publication in Bull. Math. Biol