Finding approximate patterns in undirected acyclic graphs

DOI10.1016/S0031-3203(01)00055-3zbMath0993.68102OpenAlexW2004555680WikidataQ127065483 ScholiaQ127065483MaRDI QIDQ5959618

No author found.

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)

Related Items

Simulation relations for pattern matching in directed graphs, Homeomorphic alignment of weighted trees, Homeomorphic Alignment of Edge-Weighted Trees

Cites Work

• Unnamed Item
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Finding approximate patterns in strings
• Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis
• The String-to-String Correction Problem
• Faster Scaling Algorithms for Network Problems
• ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
• Exact and approximate algorithms for unordered tree matching