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):
Displaying 6 items.
- On a matching distance between rooted phylogenetic trees (Q5396440) (← links)
- Subtree transfer operations and their induced metrics on evolutionary trees (Q5939205) (← links)
- Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks (Q6056548) (← links)
- Exploring spaces of semi-directed level-1 networks (Q6057997) (← links)
- A near-linear kernel for bounded-state parsimony distance (Q6142596) (← links)
- Ranked subtree prune and regraft (Q6194022) (← links)