Pages that link to "Item:Q1921170"
From MaRDI portal
The following pages link to Finding a maximum compatible tree is NP-hard for sequences and trees (Q1921170):
Displaying 7 items.
- Optimizing tree and character compatibility across several phylogenetic trees (Q391984) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees (Q1962070) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← links)
- Is the protein model assignment problem under linked branch lengths NP-hard? (Q2637350) (← links)
- On the complexity of comparing evolutionary trees (Q5961623) (← links)
- Beyond evolutionary trees (Q5962068) (← links)