Approximate matching for two families of trees

DOI10.1006/INCO.1995.1160MaRDI QIDQ2508340zbMATH OpenOpenAlexFDO

Authors Fabrizio Luccio, L. Pagli

Publication date 10 October 2006

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1995.1160

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• An efficient algorithm for some tree matching problems
• Ordered and Unordered Tree Inclusion
• scientific article; zbMATH DE number 826058
• Finding largest subtrees and smallest supertrees
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems

Cited in

(4)

• Tree pattern matching with a more general notion of occurrence of the pattern.
• Approximate Tree Matching in the Presence of Variable Length Don′t Cares
• scientific article; zbMATH DE number 826058 (Why is no real title available?)
• Finding approximate patterns in undirected acyclic graphs

This page was built for publication: Approximate matching for two families of trees

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