On the editing distance between unordered labeled trees
作者： Kaizhong Zhang , Rick Statman , Dennis Shasha
DOI: 10.1016/0020-0190(92)90136-J
关键词: Bounded function 、 Tree (set theory) 、 Mathematics 、 Weight-balanced tree 、 Combinatorics 、 Binary tree 、 Tree structure 、 String (computer science) 、 Computational complexity theory 、 Data structure
摘要: 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 …
acm.org
elsevier.com
grantjenks.com 
researchgate.net 参考文章(5)
Dennis E. Shasha, Kaizhong Zhang, The editing distance between trees: algorithms and applications New York University. ,(1989)
Robert A. Wagner, Michael J. Fischer, The String-to-String Correction Problem Journal of the ACM. ,vol. 21, pp. 168- 173 ,(1974) , 10.1145/321796.321811
Kuo-Chung Tai, The Tree-to-Tree Correction Problem Journal of the ACM. ,vol. 26, pp. 422- 433 ,(1979) , 10.1145/322139.322143
Kaizhong Zhang, Dennis Shasha, Simple fast algorithms for the editing distance between trees and related problems SIAM Journal on Computing. ,vol. 18, pp. 1245- 1262 ,(1989) , 10.1137/0218082
Bruce A. Shapiro, Kaizhong Zhang, Comparing multiple RNA secondary structures using tree comparisons Bioinformatics. ,vol. 6, pp. 309- 318 ,(1990) , 10.1093/BIOINFORMATICS/6.4.309