Bottom-up subtree isomorphism for unordered labeled trees

MaRDI QIDQ5441560zbMATH OpenFDO

Authors Fabrizio Luccio, L. Pagli, Antonio Mesa Enriques, Pablo Olivares-Rieumont

Publication date 15 February 2008

zbMATH Keywords

tree pattern matching

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• On finding common subtrees
• Strings, trees, and patterns
• Constrained tree inclusion
• Ordered and Unordered Tree Inclusion
• Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees

Cited in

(2)

• Mining frequent closed rooted trees
• An optimal algorithm for computing all subtree repeats in trees

This page was built for publication: Bottom-up subtree isomorphism for unordered labeled trees

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