Exact enumeration formulas for tree-child networks and galled-tree subclasses are obtained, including a component graph recurrence and new counts on eight taxa.
Counting and Enumerating Galled Networks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
q-bio.PE 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Counting Tree-Child Networks and Their Subclasses
Exact enumeration formulas for tree-child networks and galled-tree subclasses are obtained, including a component graph recurrence and new counts on eight taxa.