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 11 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)
- Retractions of finite distance functions onto tree metrics (Q1283796) (← links)
- A tree \(\cdot\) a window \(\cdot\) a hill; generalization of nearest- neighbor interchange in phylogenetic optimization (Q1344859) (← links)
- Probabilistic models in cluster analysis (Q1350792) (← links)
- Exploiting pseudo-locality of interchange distance (Q2146144) (← links)
- When is `nearest neighbour' meaningful: A converse theorem and implications (Q2272155) (← links)
- On bounds for the rotation distance between binary coupling trees (Q2741329) (← links)
- Neighborhood principle driven ICF algorithm and graph distance calculations (Q2898777) (← links)
- APPROXIMATING THE NEAREST NEIGHBOR INTERCHARGE DISTANCE FOR NON-UNIFORM-DEGREE EVOLUTIONARY TREES (Q5249276) (← links)
