Some notes on the nearest neighbour interchange distance
From MaRDI portal
Publication:6184679
DOI10.1007/3-540-61332-3_168zbMath1529.68219MaRDI QIDQ6184679
Louxin Zhang, Ming Li, John Tromp
Publication date: 29 January 2024
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Trees (05C05) Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items (2)
Classifying tree topology changes along tropical line segments ⋮ The combinatorics of discrete time-trees: theory and open problems
Cites Work
- Unnamed Item
- Approximating minimum-length-sequence metrics: A cautionary note
- Counterexamples in measuring the distance between binary trees
- Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete
- A note on some tree similarity measures
- Optimization, approximation, and complexity classes
- Short Encodings of Evolving Structures
- Comparison of labeled trees with valency three
This page was built for publication: Some notes on the nearest neighbour interchange distance
