Counterexamples in measuring the distance between binary trees

DOI10.1016/0165-4896(83)90029-XzbMath0517.05027WikidataQ124975524 ScholiaQ124975524MaRDI QIDQ1053026

Douglas R. Shier, James P. Jarvis, John K. Luedeman

Publication date: 1983

Published in: Mathematical Social Sciences (Search for Journal in Brave)

zbMATH Keywords

closest partition distance measurenearest neighbor interchange metricunordered labeled binary trees

Mathematics Subject Classification ID

Trees (05C05) Set functions and measures on spaces with additional structure (28C99)

Related Items (5)

Unnamed Item ⋮ Some notes on the nearest neighbour interchange distance ⋮ Approximating minimum-length-sequence metrics: A cautionary note ⋮ Counterexamples in measuring the distance between binary trees ⋮ A computationally efficient approximation to the nearest neighbor interchange metric

Cites Work

• Approximating minimum-length-sequence metrics: A cautionary note
• Counterexamples in measuring the distance between binary trees
• Comparison of labeled trees with valency three

This page was built for publication: Counterexamples in measuring the distance between binary trees