Counting Phylogenetic Networks with Few Reticulation Vertices: Galled and Reticulation-Visible Networks
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
Exact Enumeration of Phylogenetic Networks: The Tree-Child, Reticulation-Visible and Orchard Hierarchy
Derives closed-form differences between reticulation-visible and tree-child networks plus a rational hypergeometric generating function for orchard networks using matching polynomials of complete graphs.
-
Exact Enumeration of Phylogenetic Networks: The Tree-Child, Reticulation-Visible and Orchard Hierarchy
Derives exact enumerations, closed-form differences, and a universal hypergeometric law for orchard phylogenetic networks via generating functions and the Chang-Fuchs theorem, extending prior tables to resolve cases l...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.