APPROXIMATING THE NEAREST NEIGHBOR INTERCHARGE DISTANCE FOR NON-UNIFORM-DEGREE EVOLUTIONARY TREES

DOI10.1142/S0129054101000631zbMath1319.68252DBLPjournals/ijfcs/HonL01OpenAlexW1972216681WikidataQ58063051 ScholiaQ58063051MaRDI QIDQ5249276

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)

Related Items (1)

Non-shared edges and nearest neighbor interchanges revisited

Cites Work

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

This page was built for publication: APPROXIMATING THE NEAREST NEIGHBOR INTERCHARGE DISTANCE FOR NON-UNIFORM-DEGREE EVOLUTIONARY TREES