On the tree inclusion problem

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

Volumn 711 LNCS, Issue , 1993, Pages 211-221

  Alonso, Laurent ^a,b   Schott, René ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

FOLLOWING PROBLEM; ORDERED LABELED TREES; ROOT NODES; SUB TREES; TREE INCLUSION;

DYNAMIC PROGRAMMING;

EID: 11544324750     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57182-5_13     Document Type: Conference Paper

References (7)

1. L.Alonso, R.Schott, On the tree inclusion, preprint.
2. J.Cai, R.Paige, R.Tarjan, More efficient bottom-up tree pattern matching, Proc. CAAP’90, LNCS 31, 72-86.
3. C.M.Hoffman, M.J.O’Donnell, Pattern matching in trees, J.A.C.M., 29, 1, 68-95, 1992.
4. P.Kilpels H.Mannila, The tree inclusion problem, CAAP 91, LNCS 493, 202-214, 1991.
5. D.E.Knuth, The art of computer programming, Fundamental Algorithms, 1, Addison Wesley, 1973.
6. K.Zhang, D.Shasha, Simple fast algorithms for editing distance between trees and related problems, SIAM Journal of Computing, 18, 1245-1262, 1989
7. K.Zhang, D.Shasha, Fast Algorithms for the Unit Cost Editing Distance between Trees, Journal of Algorithms 11,581-621, 1990