The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)

Volumn 26, Issue 3, 1979, Pages 422-433

  Tai, Kuo Chung ^a  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

tree correction; tree modification; tree similarity

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES;

DATA PROCESSING;

EID: 0018491659     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322139.322143     Document Type: Article

References (14)

1. Aho, A V, Hirschberg, D S, and Ullman, J D Bounds on the complexity of the longest common subsequence problem J ACM 23, 1 (Jan 1976), 1-12.
2. Fu, K S, and Bhargava, B K Tree systems for syntactic pattern recognition IEEE Trans Comptrs C-22, 12 (Dec 1973), 1087-1099.
3. Hirschberg, D S A linear space algorithm for computing maximal common subsequences Comm A CM 18, 6 (June 1975), 341-343.
4. Hirschberg, D.S. Algorithms for the longest common subsequence problem J ACM 24, 4 (Oct 1977), 664-675.
5. Hunt, J W, and Szymanski, T G A fast algorithm for computing longest common subsequences Comm ACM 20, 5 (May 1977), 350-353.
6. Knuth, DE The An of Computer Programming, Vol 1 Fundamental Algorithms Addison-Wesley, Reading, Mass, sec ed, 1973.
7. Lowrance, R, and Wagner, R A An extension of the string-to-string correction problem J ACM 22, 2 (April 1975), 177-183.
8. Sankoff, D Matching sequences under deletion/insertion constraints Proc Nat Acad Sci USA 69, 1 (Jan 1974), 4-6.
9. Selkow, S M The tree-to-tree editing problem Inform Processing Letters 6, 6(Dec 1977), 184-186.
10. Sellers, P H An algorithm for the distance between two finite sequences J Combin Theory, Ser A, 16 (1974), 253-258.
11. Tai, K C Syntactic Error Correction In Programming Languages Ph D Th, Dept Comptr. Sci, Cornell U, Ithaca, N Y, 1977.
12. Wagner, R A On the complexity of the extended string-to-stnng correction problem Proc Seventh Annual ACM Symp on Theory of Comptng, Albuquerque, New Mex, 1975, pp 218-223.
13. Wagner, R A, and Fischer, M J The string-to-stnng correction problem. J ACM 21, 1 (Jan 1974), 168-173.
14. Wong, C K, and Chandra, A K Bounds for the string editing problem J. ACM 23, 1 (Jan 1976), 13-16.