Approximating the nearest neighbor intercharge distance for non-uniform-degree evolutionary trees

DOI10.1142/S0129054101000631MaRDI QIDQ5249276zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Wing-Kai Hon, Tak-Wah Lam

Publication date 30 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054101000631

Mathematics Subject Classification ID

Problems related to evolution (92D15) Approximation algorithms (68W25)

Recommendations

• On computing the nearest neighbor interchange distance
• A computationally efficient approximation to the nearest neighbor interchange metric
• scientific article; zbMATH DE number 1302179
• Non-shared edges and nearest neighbor interchanges revisited
• On the linear-cost subtree-transfer distance between phylogenetic trees

Cites work

• A note on some tree similarity measures
• Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
• Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete
• Tree Contractions and Evolutionary Trees

Cited in

(6)

• A computationally efficient approximation to the nearest neighbor interchange metric
• On computing the nearest neighbor interchange distance
• Semi‐labeled unrooted binary tree optimization subject to nonnegativity
• Non-shared edges and nearest neighbor interchanges revisited
• Some notes on the nearest neighbour interchange distance
• Distance-driven adaptive trees in biological metric spaces: uninformed accretion does not prevent convergence

This page was built for publication: Approximating the nearest neighbor intercharge distance for non-uniform-degree evolutionary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249276)