On the editing distance between unordered labeled trees. (English) Zbl 0780.68070

Summary: 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.


68Q25 Analysis of algorithms and problem complexity
68P05 Data structures
Full Text: DOI


[1] Garey, M. R.; Johnson, D. S., Computers and Intractability (1979), Freeman: Freeman New York · Zbl 0411.68039
[2] Shapiro, B.; Zhang, K., Comparing multiple RNA secondary structures using tree comparisons, Comput. Appl. Biosci., 6, 4, 309-318 (1990)
[3] Tai, K. C., The tree-to-tree correction problem, J. ACM, 26, 422-433 (1979) · Zbl 0409.68040
[4] Wagner, R. A.; Fisher, M. J., The string to string correction problem, J. ACM, 21, 168-173 (1974) · Zbl 0278.68032
[5] Zhang, K., The editing distance between trees: algorithms and applications, (Ph.D. Thesis (1989), Dept. of Computer Science, Courant Institute)
[6] Zhang, K.; Shasha, D., Simple fast algorithms for the editing distance between trees and related problems, SIAM J. Comput., 18, 1245-1262 (1989) · Zbl 0692.68047
[7] Zhang, K.; Statman, R.; Shasha, D., On the editing distance between unordered labeled trees, (Tech. Rept. No. 289 (1991), Dept. of Computer Science, The University of Western Ontario) · Zbl 0780.68070
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.