Pages that link to "Item:Q860811"
From MaRDI portal
The following pages link to Computing phylogenetic roots with bounded degrees and errors is NP-complete (Q860811):
Displaying 5 items.
- Approximation algorithms for bounded degree phylogenetic roots (Q926287) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- The Complexity of Rooted Phylogeny Problems (Q3224696) (← links)
- Computing and Combinatorics (Q4681207) (← links)
- A survey on pairwise compatibility graphs (Q5012383) (← links)