Faster tree pattern matching
From MaRDI portal
Publication:4299006
DOI10.1145/174652.174653zbMath0806.68055OpenAlexW2040864705MaRDI QIDQ4299006
Edith Magen, Moshe Dubiner, Zvi Galil
Publication date: 13 February 1995
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/174652.174653
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Related Items (10)
A set automaton to locate all pattern matches in a term ⋮ Pattern matching in a digitized image ⋮ Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees ⋮ A survey on tree matching and XML retrieval ⋮ Order Preserving Pattern Matching on Trees and DAGs ⋮ More efficient bottom-up multi-pattern matching in trees ⋮ A new algorithm for linear regular tree pattern matching ⋮ TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING ⋮ Tree pattern matching with a more general notion of occurrence of the pattern. ⋮ Comparing and distinguishing the structure of biological branching
This page was built for publication: Faster tree pattern matching
