A computationally efficient approximation to the nearest neighbor interchange metric
- 1 December 1984
- journal article
- Published by Springer Science and Business Media LLC in Journal of Classification
- Vol. 1 (1), 93-124
- https://doi.org/10.1007/bf01890118
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Counterexamples in measuring the distance between binary treesMathematical Social Sciences, 1983
- Approximating minimum-length-sequence metrics: a cautionary noteMathematical Social Sciences, 1983
- An Overview of Sequence Comparison: Time Warps, String Edits, and MacromoleculesSIAM Review, 1983
- Properties of the nearest neighbor interchange metric for trees of small sizeJournal of Theoretical Biology, 1983
- Comments on computing the similarity of binary treesJournal of Theoretical Biology, 1983
- Numerical Methods for Inferring Evolutionary TreesThe Quarterly Review of Biology, 1982
- A note on some tree similarity measuresInformation Processing Letters, 1982
- The complexity of computing metric distances between partitionsMathematical Social Sciences, 1981
- General Lattice TheoryPublished by Springer Science and Business Media LLC ,1978
- Metrics on spaces of finite treesJournal of Mathematical Psychology, 1973