scientific article; zbMATH DE number 1559523

MaRDI QIDQ4526971zbMATH OpenFDO

Authors Ramesh Hariharan, Richard Cole

Publication date 28 February 2001

zbMATH Keywords

tree pattern matching problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1305413
• Tree Pattern Matching to Subset Matching in Linear Time
• An efficient algorithm for some tree matching problems
• Approximate subset matching with don't cares
• scientific article; zbMATH DE number 4053042

Cited in

(8)

• Faster pattern matching with character classes using prime number encoding
• Tree pattern matching with a more general notion of occurrence of the pattern.
• On the hardness of optimal vertex relabeling and restricted vertex relabeling
• A survey on tree matching and XML retrieval
• scientific article; zbMATH DE number 1305413 (Why is no real title available?)
• Approximate Tree Matching in the Presence of Variable Length Don′t Cares
• Tree Pattern Matching to Subset Matching in Linear Time
• A unifying taxonomy of pattern matching in degenerate strings and founder graphs

This page was built for publication:

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