Pages that link to "Item:Q2115868"
From MaRDI portal
The following pages link to Complexity and algorithms for MUL-tree pruning (Q2115868):
Displaying 5 items.
- Pruning by isomorphism in branch-and-cut (Q1396814) (← links)
- On the computational complexity of the rooted subtree prune and regraft distance (Q1764471) (← links)
- MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms (Q2089669) (← links)
- Pruning of CRT-sub-trees (Q2258835) (← links)
- (Q4537751) (← links)