Tree Pattern Matching to Subset Matching in Linear Time

DOI10.1137/S0097539700382704MaRDI QIDQ4429673zbMATH OpenOpenAlexFDO

Authors Ramesh Hariharan, Richard Cole

Publication date 28 September 2003

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539700382704

zbMATH Keywords

tree pattern matchingsubset matching

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1305413
• scientific article; zbMATH DE number 1559523
• An efficient algorithm for some tree matching problems
• Strings, trees, and patterns
• Faster Subtree Isomorphism

Cited in

(12)

• TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING
• A survey on tree matching and XML retrieval
• FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
• Indeterminate string inference algorithms
• More efficient bottom-up multi-pattern matching in trees
• A linear time and space algorithm for finding isomorphic subtrees of a binary tree
• Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
• IDPM: an improved degenerate pattern matching algorithm for biological sequences
• scientific article; zbMATH DE number 4053042 (Why is no real title available?)
• scientific article; zbMATH DE number 1559523 (Why is no real title available?)
• On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
• Set intersection and sequence matching with mismatch counting

This page was built for publication: Tree Pattern Matching to Subset Matching in Linear Time

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