Pages that link to "Item:Q1057598"
From MaRDI portal
The following pages link to A computationally efficient approximation to the nearest neighbor interchange metric (Q1057598):
Displaying 5 items.
- Discriminative measures for comparison of phylogenetic trees (Q516872) (← links)
- Optimal algorithms for comparing trees with labeled leaves (Q1074275) (← links)
- Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete (Q1077168) (← links)
- Probabilistic models in cluster analysis (Q1350792) (← links)
- (Q2741329) (← links)
