论文信息 - On the Editing Distance Between Unordered Labeled Trees

On the Editing Distance Between Unordered Labeled Trees

This paper considers the problem of computing the editing distance between unordered, labeled trees. We give efficient polynomial-time algorithms for the case when one tree is a string or has a bounded number of leaves. By contrast, we show that the problem is NP-complete even for binary trees having a label alphabet of size two.

[1] Kaizhong Zhang,et al. Comparing multiple RNA secondary structures using tree comparisons , 1990, Comput. Appl. Biosci..

[2] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.

[3] Kaizhong Zhang,et al. Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems , 1989, SIAM J. Comput..

[4] Kuo-Chung Tai,et al. The Tree-to-Tree Correction Problem , 1979, JACM.

[5] Kaizhong Zhang,et al. The editing distance between trees: Algorithms and applications , 1989 .