Finding approximate patterns in undirected acyclic graphs

DOI10.1016/S0031-3203(01)00055-3MaRDI QIDQ5959618zbMATH OpenOpenAlexWikidataFDO

Authors Jason T. L. Wang, Kaizhong Zhang, George Chang, Dennis Shasha

Publication date 29 September 2002

Published in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0031-3203(01)00055-3

zbMATH Keywords

pattern matching problemundirected acyclic graphs

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• Algorithms for approximate graph matching
• An efficient algorithm for some tree matching problems
• ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
• Approximate matching for two families of trees
• scientific article; zbMATH DE number 826058

Cites work

• Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis
• Exact and approximate algorithms for unordered tree matching
• Faster Scaling Algorithms for Network Problems
• Finding approximate patterns in strings
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• The String-to-String Correction Problem

Cited in

(9)

• Algorithms for approximate graph matching
• Degree reduction in labeled graph retrieval
• Partial information network queries
• Directed Graph Pattern Matching and Topological Embedding
• Finding patterns in an unknown graph
• Homeomorphic Alignment of Edge-Weighted Trees
• Simulation relations for pattern matching in directed graphs
• scientific article; zbMATH DE number 33703 (Why is no real title available?)
• Homeomorphic alignment of weighted trees

This page was built for publication: Finding approximate patterns in undirected acyclic graphs

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