On computing the nearest neighbor interchange distance
From MaRDI portal
Publication:5457044
Recommendations
- On the linear-cost subtree-transfer distance between phylogenetic trees
- Subtree transfer operations and their induced metrics on evolutionary trees
- A computationally efficient approximation to the nearest neighbor interchange metric
- Non-shared edges and nearest neighbor interchanges revisited
- Approximating the nearest neighbor intercharge distance for non-uniform-degree evolutionary trees
Cited In (19)
- A computationally efficient approximation to the nearest neighbor interchange metric
- Neighborhoods of phylogenetic trees: exact and asymptotic counts
- Neighborhood principle driven ICF algorithm and graph distance calculations
- Walks in phylogenetic treespace
- Approximating geodesic tree distance
- Fast algorithms for the rooted triplet distance between caterpillars
- Title not available (Why is no real title available?)
- A note on the path interval distance
- Exploiting pseudo-locality of interchange distance
- Approximating the nearest neighbor intercharge distance for non-uniform-degree evolutionary trees
- Benefit of Interpolation in Nearest Neighbor Algorithms
- The tree nearest on average to a given set of trees
- Computing nearest neighbour interchange distances between ranked phylogenetic trees
- Properties for the Fréchet mean in Billera-Holmes-Vogtmann treespace
- Some notes on the nearest neighbour interchange distance
- Discrete coalescent trees
- The combinatorics of discrete time-trees: theory and open problems
- A tree \(\cdot\) a window \(\cdot\) a hill; generalization of nearest- neighbor interchange in phylogenetic optimization
- Distributions of topological tree metrics between a species tree and a gene tree
This page was built for publication: On computing the nearest neighbor interchange distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5457044)