Advertisement

On the tree inclusion problem

  • Laurent Alonso
  • René Schott
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 711)

Abstract

We consider the following problem: Given ordered labeled trees S and T can S be obtained from T by deleting nodes ? Deletion of the root node u of a subtree with children (T1,..., Tn) means replacing the subtree by the trees T1,...,Tn. For the tree inclusion problem,there can generally be exponentially many ways to obtain the included tree. Recently, P.Kilpeläinen and H.Mannila [KM] gave an algorithm based on dynamic programming requiring O(¦ S ¦ · ¦ T ¦) time and space in the worst case and also on the average. We give a new algorithm which improves the previous one on the average and breaks the ¦ S ¦ · ¦ T ¦ barrier.

Keywords

Editing Distance Label Tree Average Complexity Inclusion Search Cost Editing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Laurent Alonso
    • 1
    • 2
  • René Schott
    • 3
  1. 1.E.N.S.ParisFrance
  2. 2.CRIN, INRIA-LorraineUniversité de Nancy 1Vandoeuvre-lès-NancyFrance
  3. 3.CRIN, INRIA-LorraineUniversité de Nancy lVandoeuvre-lès-NancyFrance

Personalised recommendations