Faster tree pattern matching

DOI10.1145/174652.174653MaRDI QIDQ4299006zbMATH OpenOpenAlexFDO

Authors Moshe Dubiner, Edith Magen, 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

zbMATH Keywords

convolutionstring matchingtree pattern matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Cited in

(13)

• Pattern matching in a digitized image
• A new algorithm for linear regular tree pattern matching
• Tree pattern matching with a more general notion of occurrence of the pattern.
• A set automaton to locate all pattern matches in a term
• Comparing and distinguishing the structure of biological branching
• Fast searching in trees
• Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
• TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING
• scientific article; zbMATH DE number 4053042 (Why is no real title available?)
• 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
• Parallel tree pattern matching

This page was built for publication: Faster tree pattern matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4299006)