Counting and Enumerating Galled Networks
Populations and Evolution
2018-12-21 v1
Abstract
Galled trees are widely studied as a recombination model in population genetics. This class of phylogenetic networks is generalized into galled networks by relaxing a structural condition. In this work, a linear recurrence formula is given for counting 1-galled networks, which are galled networks satisfying the condition that each reticulate node has only one leaf descendant. Since every galled network consists of a set of 1-galled networks stacked one on top of the other, a method is also presented to count and enumerate galled networks.
Cite
@article{arxiv.1812.08569,
title = {Counting and Enumerating Galled Networks},
author = {Andreas DM Gunawan and Jeyaram Rathin and Louxin Zhang},
journal= {arXiv preprint arXiv:1812.08569},
year = {2018}
}
Comments
7 figures, 2 tables