Pith. sign in

REVIEW 1 cited by

Counting and Enumerating Galled Networks

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1812.08569 v1 pith:DNI4VBL6 submitted 2018-12-20 q-bio.PE

Andreas DM Gunawan , Jeyaram Rathin , Louxin Zhang This is my paper · ORCID
classification q-bio.PE
keywords gallednetworksconditioncountingclassconsistscountdescendant
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Counting Tree-Child Networks and Their Subclasses

    q-bio.PE 2019-08 conditional novelty 7.0 of 10

    Exact enumeration formulas for tree-child networks and galled-tree subclasses are obtained, including a component graph recurrence and new counts on eight taxa.

Pith tools