Approximating minimum-length-sequence metrics: A cautionary note

DOI10.1016/0165-4896(83)90028-8zbMath0513.90047OpenAlexW2001514895MaRDI QIDQ1050904

Ralph P. Boland, William H. E. Day, Edward K. Brown

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0165-4896(83)90028-8

zbMATH Keywords

approximationefficient algorithmdissimilarity measureclosest partition distance measurecomputation of distanceslabeled binary treesminimum-length-sequence metricsnearest neighbor interchange metricsimilarity of classifications

Mathematics Subject Classification ID

Operations research and management science (90B99)

Related Items (5)

Unnamed Item ⋮ Some notes on the nearest neighbour interchange distance ⋮ Counterexamples in measuring the distance between binary trees ⋮ Properties of Levenshtein metrics on sequences ⋮ A computationally efficient approximation to the nearest neighbor interchange metric

Cites Work

• Unnamed Item
• Unnamed Item
• Metrics on spaces of finite trees
• Counterexamples in measuring the distance between binary trees
• Comparison of phylogenetic trees
• The complexity of computing metric distances between partitions
• Distances between trees
• Multidimensional scaling of measures of distance between partitions
• Comparison of labeled trees with valency three

This page was built for publication: Approximating minimum-length-sequence metrics: A cautionary note