The tree-to-tree editing problem

Information Processing Letters

Volumn 6, Issue 6, 1977, Pages 184-186

  Selkow, Stanley M ^a  

^a UNIVERSITY OF TENNESSEE   (United States)

Author keywords

algorithm; editing; Tree; tree correction

Indexed keywords

EID: 0001122858     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(77)90064-3     Document Type: Article

References (4)

1. Bounds on the complexity of the longest common subsequence problem
2. Matching sequences under deletion/insertion constraints
3. The string-to-string correction problem
4. Bounds for the string editing problem