Pages that link to "Item:Q1883389"
From MaRDI portal
The following pages link to Counting consistent phylogenetic trees is \#P-complete (Q1883389):
Displaying 7 items.
- Counting trees in a graph is \(\# \text{P}\)-complete (Q1332763) (← links)
- Enumeration of binary trees compatible with a perfect phylogeny (Q2140024) (← links)
- Recovering a phylogenetic tree using pairwise closure operations (Q2484621) (← links)
- Counting trees in a phylogenetic network is \#P-complete (Q2862211) (← links)
- Counting Unlabelled Subtrees of a Tree is #P-complete (Q4504966) (← links)
- The Complexity of Phylogeny Constraint Satisfaction (Q4601872) (← links)
- The Complexity of Phylogeny Constraint Satisfaction Problems (Q5369246) (← links)