On computing the nearest neighbor interchange distance

MaRDI QIDQ5457044zbMATH OpenFDO

Authors Xin He, Tao Jiang, John Tromp, Louxin Zhang, Bhaskar Dasgupta, Ming Li

Publication date 14 April 2008

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Problems related to evolution (92D15)

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

(21)

• A computationally efficient approximation to the nearest neighbor interchange metric
• On the linear-cost subtree-transfer distance between phylogenetic trees
• A tree \(\cdot\) a window \(\cdot\) a hill; generalization of nearest- neighbor interchange in phylogenetic optimization
• Walks in phylogenetic treespace
• Fast algorithms for the rooted triplet distance between caterpillars
• Exploiting pseudo-locality of interchange distance
• Properties for the Fréchet mean in Billera-Holmes-Vogtmann treespace
• Approximating geodesic tree distance
• Distributions of topological tree metrics between a species tree and a gene tree
• Neighborhood principle driven ICF algorithm and graph distance calculations
• scientific article; zbMATH DE number 1302179 (Why is no real title available?)
• scientific article; zbMATH DE number 2080274 (Why is no real title available?)
• Benefit of Interpolation in Nearest Neighbor Algorithms
• Approximating the nearest neighbor intercharge distance for non-uniform-degree evolutionary trees
• Neighborhoods of phylogenetic trees: exact and asymptotic counts
• Some notes on the nearest neighbour interchange distance
• A note on the path interval distance
• The tree nearest on average to a given set of trees
• The combinatorics of discrete time-trees: theory and open problems
• Computing nearest neighbour interchange distances between ranked phylogenetic trees
• Discrete coalescent trees

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)