Analysis of two-dimensional approximate pattern matching algorithms

DOI10.1016/S0304-3975(97)00277-6zbMath0902.68176MaRDI QIDQ1129016

Kun Soo Park

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

approximate matchingtwo-dimensional pattern matchingChernoff bound technique

Mathematics Subject Classification ID

Searching and sorting (68P10) Pattern recognition, speech recognition (68T10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-dimensional pattern matching by sampling
• Data structures and algorithms for approximate string matching
• Sublinear approximate string matching and biological applications
• Fast parallel and serial multidimensional approximate array matching
• An Improved Algorithm For Approximate String Matching
• Efficient string matching
• An Alphabet Independent Approach to Two-Dimensional Pattern Matching
• Alphabet-Independent Two-Dimensional Witness Computation

This page was built for publication: Analysis of two-dimensional approximate pattern matching algorithms