REVIEW 1 cited by
Counting cherry reduction sequences is counting linear extensions (in phylogenetic tree-child networks)
Not yet reviewed by Pith; the record is open.
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
read the original abstract
Orchard and tree-child networks share an important property with phylogenetic trees: they can be completely reduced to a single node by iteratively deleting cherries and reticulated cherries. As it is the case with phylogenetic trees, the number of ways in which this can be done gives information about the topology of the network. Here, we show that the problem of computing this number in tree-child networks is akin to that of finding the number of linear extensions of the poset induced by each network, and give an algorithm based on this reduction whose complexity is bounded in terms of the level of the network.
Forward citations
Cited by 1 Pith paper
-
Bounds on the Treewidth of Level-k Rooted Phylogenetic Networks
For level-k phylogenetic networks, the paper proves treewidth is at most (k+3)/2, improves this to about k/3 for large k, and shows some level-k networks have treewidth at least k/13.
Discussion (0). Continue with ORCID to comment.