Analysis of two-dimensional approximate pattern matching algorithms
type: Item
instance of: scholarly article
title: Analysis of two-dimensional approximate pattern matching algorithms
zbMATH Open document ID: 0902.68176
DOI: 10.1016/S0304-3975(97)00277-6
published in: Theoretical Computer Science
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 1190165
zbMATH Keywords: two-dimensional pattern matching
zbMATH Keywords: approximate matching
zbMATH Keywords: Chernoff bound technique
author: Kunsoo Park
MaRDI profile type: Publication
cites work: Efficient string matching
cites work: An Alphabet Independent Approach to Two-Dimensional Pattern Matching
cites work: Q3138956
cites work: Fast parallel and serial multidimensional approximate array matching
cites work: Sublinear approximate string matching and biological applications
cites work: Two-dimensional pattern matching by sampling
cites work: Data structures and algorithms for approximate string matching
cites work: An Improved Algorithm For Approximate String Matching
cites work: Alphabet-Independent Two-Dimensional Witness Computation
cites work: Q3128935
cites work: Q5585020
cites work: Q4856179
cites work: Q4895141
description: scientific article; zbMATH DE number 1190165