Tree Pattern Matching to Subset Matching in Linear Time

DOI10.1137/S0097539700382704zbMath1029.68153OpenAlexW1975200441MaRDI QIDQ4429673

Ramesh Hariharan, Richard John 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)

Related Items (6)

Set intersection and sequence matching with mismatch counting ⋮ Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees ⋮ A survey on tree matching and XML retrieval ⋮ Indeterminate string inference algorithms ⋮ IDPM: An Improved Degenerate Pattern Matching Algorithm for Biological Sequences ⋮ FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES

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