Pages that link to "Item:Q1764471"
From MaRDI portal
The following pages link to On the computational complexity of the rooted subtree prune and regraft distance (Q1764471):
Displayed 3 items.
- Computing the minimum number of hybridization events for a consistent evolutionary history (Q881571) (← links)
- Bounding the number of hybridisation events for a consistent evolutionary history (Q2388380) (← links)
- Haplotype Inferring Via Galled-Tree Networks Is NP-Complete (Q3511338) (← links)