A new measure of edit distance between labeled trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2108, Issue , 2001, Pages 338-348

  Lu, Chin Lung ^a   Su, Zheng Yao ^a   Tang, Chuan Yi ^b  

^a NATIONAL CENTER FOR HIGH PERFORMANCE COMPUTING   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; FORESTRY; MAPPING; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION;

ALGORITHMIC COMPLEXITY; COMPUTATIONAL BIOLOGY; CONSTRAINED EDIT DISTANCES; EVOLUTIONARY TREE; ORDERED LABELED TREES; POLYNOMIAL-TIME ALGORITHMS; RNA SECONDARY STRUCTURES; UNORDERED LABELED TREE;

TREES (MATHEMATICS);

EID: 84944064275     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_37     Document Type: Conference Paper

References (11)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and the hardness of approximation problems, Journal of the Association for Computing Machinery, 45 (1998) 501–555.
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamelai, and M. Protasi, Complexity and Approximation—Combinatorial Optimization Problems and Their Approximability Properties, Springer Verlag, Berlin, 1999.
3. M.R. Garey and D.S. Johnson, Computers and Intractability—A Guide to the Theory of NP-Completeness, San Francisco, Freeman, 1979.
4. V. Kann, Maximum bounded 3-dimensional matching is MAX SNP-complete, Information Processing Letters, 37 (1991) 27–35.
5. T. Richter, A new measure of the distance between ordered trees and its applications, Technical Report 85166-CS, Department of Computer Science, University of Bonn, 1997.
6. E. Tanaka and K. Tanaka, The tree-to-tree editing problem, International Journal of Pattern Recognition and Artificial Intelligence, 2 (1988) 221–240.
7. K. Zhang, Algorithms for the constrained editing distance between ordered labeled trees and related problems, Pattern Recognition, 28 (1995) 463–474.
8. K. Zhang, A constrained edit distance between unordered labeled trees, Algorithmica, 15 (1996) 205–222.
9. K. Zhang and T. Jiang, Some MAX SNP-hard results concerning unordered labeled trees, Information Processing Letters, 49 (1994) 249–254.
10. K. Zhang and D. Shasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM Journal on Computing, 18 (1989) 1245–1262.
11. K. Zhang, R. Statman, and D. Shasha, On the editing distance between unordered labeled trees, Information Processing Letters, 42 (1992) 133–139.