Non-shared edges and nearest neighbor interchanges revisited

DOI10.1016/j.ipl.2004.04.003zbMath1192.68905OpenAlexW2063145675WikidataQ58063024 ScholiaQ58063024MaRDI QIDQ2390296

Wing-Kai Hon, Wing-Kin Sung, Ming-Yang Kao, Siu-Ming Yiu, Tak-Wah Lam

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.04.003

zbMATH Keywords

algorithmsphylogenetic treeNNI distancenon-shared edge distance

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (1)

Fast algorithms for computing the tripartition-based distance between phylogenetic networks

Cites Work

• Unnamed Item
• Optimal algorithms for comparing trees with labeled leaves
• Comparison of phylogenetic trees
• Fast Algorithms for Finding Nearest Common Ancestors
• APPROXIMATING THE NEAREST NEIGHBOR INTERCHARGE DISTANCE FOR NON-UNIFORM-DEGREE EVOLUTIONARY TREES
• Comparison of labeled trees with valency three

This page was built for publication: Non-shared edges and nearest neighbor interchanges revisited