Approximation and special cases of common subtrees and editing distance

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

Volumn 1178, Issue , 1996, Pages 75-84

  Halldórsson, Magnús M ^a   Tanaka, Keisuke ^b  

^a UNIVERSITY OF ICELAND   (Iceland)

^b JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; FORESTRY; POLYNOMIAL APPROXIMATION;

APPROXIMATION HARDNESS; APPROXIMATION RATIOS; CARDINALITIES; CONSTANT FACTORS; POLYNOMIAL ALGORITHM; SPECIAL CLASS; TREE EDITING; UNORDERED TREES;

TREES (MATHEMATICS);

EID: 84990248802     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0009483     Document Type: Conference Paper

References (4)

1. rescenzi, P., and Kann, V. A compendium of NP optimization problems. Dynamic on-line survey available at ftp.nada.kth.se, Oct. 1995.
2. Yamaguchi, A. Approximation algorithm for the maximum common hereditary subtree problem. Manuscript. (In Japanese), Nov. 1994.
3. Zhang, K., and Jiang, T. Some MAX SNP-hard results concerning unordered labeled trees. Inf. Process. Lett. 42 (1994), 133–139.
4. Zhang, K., Statman, R., and Shasha, D. On the editing distance between unordered labeled trees. Inf. Process. Lett. 42 (1992), 133–139.