Efficient matching of nonrectangular shapes.

DOI10.1007/BF01531057zbMath1034.68537OpenAlexW2040866432MaRDI QIDQ1354075

Amihood Amir, Martin Farach

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01531057

zbMATH Keywords

matching algorithms

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (4)

On a conjecture on bidimensional words. ⋮ Hamming Distance Completeness ⋮ On Fine and Wilf's theorem for bidimensional words. ⋮ Recent advances in text-to-pattern distance algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• A fast string searching algorithm
• Finding approximate patterns in strings
• Generalized String Matching
• Efficient string matching
• Fast Pattern Matching in Strings

This page was built for publication: Efficient matching of nonrectangular shapes.