Counterexamples in measuring the distance between binary trees |
| |
| Authors: | JP Jarvis JK Luedeman DR Shier |
| |
| Institution: | Department of Mathematical Sciences, Clemson University, Clemson, SC 29631, U.S.A. |
| |
| Abstract: | Examples are given to show that the closest partition distance measure need not agree with the nearest neighbor interchange distance for unordered labeled binary trees. Proposed algorithms for computing the closest partition distance are shown to be of exponential complexity and hence may not be useful in approximating the nearest neighbor interchange distance. |
| |
| Keywords: | Algorithm dendrogram metric partition distance measure nearest neighbor interchange distance |
| 本文献已被 ScienceDirect 等数据库收录！ |
