Tree pattern matching with a more general notion of occurrence of the pattern

doi:10.1016/S0020-0190(01)00270-8

Information Processing Letters

Volume 82, Issue 4, 31 May 2002, Pages 197-201

https://doi.org/10.1016/S0020-0190(01)00270-8 Get rights and content

Abstract

Since the initial paper of Hoffmann and O'Donnell [J. ACM 29 (1) (1982) 68–95], tree pattern matching has been studied by many authors. However, all the papers proposing algorithms for this problem deal with a restricted notion of pattern occurrence in the subject. In this note, we consider a more general notion of occurrence and we give an extension of the top-down algorithm of Hoffmann and O'Donnell for this notion.

References (11)

F. Luccio et al.
An efficient algorithm for some tree matching problems
Inform. Process. Lett.
(1991)
F. Luccio et al.
Approximate matching for two families of trees
Inform. and Comput.
(1995)
A.V. Aho et al.
Efficient string matching: An aid to bibliographic search
Comm. ACM
(1975)
R. Cole et al.
Tree pattern matching and subset matching in randomized O(nlog³m) time

There are more references available in the full text version of this article.

Cited by (4)

Bit-parallel tree pattern matching algorithms for unordered labeled trees
2009, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
A bit-parallel tree matching algorithm for patterns with horizontal VLDC's
2005, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
On the algorithm of berztiss for tree pattern matching
2004, Proceedings of the Fifth Mexican International Conference in Computer Science, ENC 2004
Tree pattern matching for linear static terms
2002, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

View full text

Tree pattern matching with a more general notion of occurrence of the pattern

Abstract

Inform. Process. Lett.

Inform. and Comput.

Efficient string matching: An aid to bibliographic search

Comm. ACM

Tree pattern matching and subset matching in randomized O(nlog3m) time

Tree pattern matching and subset matching in randomized O(nlog³m) time