More efficient bottom-up tree pattern matching

DOI10.1007/3-540-52590-4_41MaRDI QIDQ4027620zbMATH OpenFDO

Authors Jiazhen Cai, Robert E. Tarjan, R. Paige

Publication date 21 February 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-52590-4_41

zbMATH Keywords

pattern matching in trees

Mathematics Subject Classification ID

Theory of programming languages (68N15) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• More efficient bottom-up multi-pattern matching in trees
• Nonlinear pattern matching in trees
• scientific article; zbMATH DE number 4053042
• Efficient preprocessing of simple binary pattern forests
• Efficient Preprocessing of Simple Binary Pattern Forests

Cited in

(9)

• 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
• Efficient Preprocessing of Simple Binary Pattern Forests
• Efficient preprocessing of simple binary pattern forests
• Incremental techniques for efficient normalization of nonlinear rewrite systems
• Generating tables for bottom-up matching
• Computational Science and Its Applications – ICCSA 2004
• More efficient bottom-up multi-pattern matching in trees

This page was built for publication: More efficient bottom-up tree pattern matching

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