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

Authors:
Cedric Chauve
Affiliations:
LaBRI, Université de Bordeaux I, 351 Cours de la Libération, 33405 Talence cedex, France
Venue:
Information Processing Letters
Year:
2002

Citing 10
Cited 3

An efficient algorithm for some tree matching problems

Information Processing Letters
Faster tree pattern matching

Journal of the ACM (JACM)
Text algorithms

Text algorithms
Approximate matching for two families of trees

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

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Pattern matching algorithms

Pattern matching algorithms
Tree pattern matching and subset matching in deterministic O(n log3 n)-time

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Pattern Matching in Trees

Journal of the ACM (JACM)
Efficient string matching: an aid to bibliographic search

Communications of the ACM

Tree Pattern Matching for Linear Static Terms

SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
A bit-parallel tree matching algorithm for patterns with horizontal VLDC's

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval

Quantified Score

Hi-index	0.89

Visualization

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.