Patterns and pattern-matching in trees: an analysis
Information and Control
Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Simple solutions for approximate tree matching problems
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
An efficient algorithm for some tree matching problems
Information Processing Letters
More efficient bottom-up multi-pattern matching in trees
CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Journal of the ACM (JACM)
Text algorithms
Approximate matching for two families of trees
Information and Computation
Efficient preprocessing of simple binary pattern forests
Journal of Algorithms
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
Tree pattern matching and subset matching in deterministic O(n log3 n)-time
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient tree pattern matching (extended abstract): an aid to code generation
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Journal of the ACM (JACM)
A fast string searching algorithm
Communications of the ACM
Tree pattern matching with a more general notion of occurrence of the pattern
Information Processing Letters
Constructing the Suffix Tree of a Tree with a Large Alphabet
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Efficient tree pattern matching
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Stream processing of XPath queries with predicates
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
| Hi-index | 0.00 |
In this paper, we present a simple algorithm for pattern matching within a family of trees called linear terms, that have many applications in the design of programming languages, theorem proving and symbolic computation for example. Our algorithm relies on the representation of a tree by words. It has a quadratic worst-case time complexity, which is worse than the best known algorithm, but experimental results on uniformly distributed random binary terms suggest a linear expected time and interesting practical behavior.