Simple solutions for approximate tree matching problems

  • Fabrizio Luccio
  • Linda Pagli
CAAP Colloquium On Trees In Algebra And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 493)


Internal Node Match Problem Suffix Tree External Node Approximate String Match 
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.


  1. [1]
    M. Dubiner, Z. Galil and E. Magen, Faster tree pattern matching, Proc. 31-st IEEE Symp. on Found. of Comp. Sc. (1990) 145–149.Google Scholar
  2. [2]
    Z. Galil and R. Giancarlo, Data structures and algorithms for approximate string matching, J. Complexity 4 (1988) 33–72.Google Scholar
  3. [3]
    D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comp. 13 (1984) 338–355.Google Scholar
  4. [4]
    C.M. Hoffmann and M.J. O'Donnell, Pattern matching in trees, J. ACM 29 (1982) 68–95.Google Scholar
  5. [5]
    S.R. Kosaraju, Efficient tree pattern matching, Proc. 30-th IEEE Symp. on found. of Comp. Sc.(1989) 178–183.Google Scholar
  6. [6]
    G.M. Landau and U. Vishkin, Introducing efficient parallelism into approximate string matching and a new serial algorithm, Proc. 18-th ACM Symp. on Theory of Comp. (1986) 220–230.Google Scholar
  7. [7]
    E. Mäkinen, On the subtree isomorphism problem for ordered trees, Inf. Proc. Let. 32 (1989) 271–273.Google Scholar
  8. [8]
    L. Stryer, Biochemestry, 3-rd edition, W.H.Freeman and Co., New York, NY 1988.Google Scholar
  9. [8]
    K. Zhang and D. Shasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM J. Comp. 18 (1989) 1245–1262.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Fabrizio Luccio
    • 1
  • Linda Pagli
    • 1
  1. 1.Dipartimento di InformaticaUniversità di PisaPisaItaly

Personalised recommendations