Abstract
Purchase PDF (947 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (11)
Purchase PDF (589 K)
doi:10.1016/0020-0255(87)90037-5 
Copyright © 1987 Published by Elsevier Science Inc.
Efficient two-dimensional pattern matching in the presence of errors*1
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Kamala Krithivasan†
R. Sitalakshmi
Received 4 April 1987.
Communicated by Azriel Rosenfeld
Available online 20 May 2003.
Abstract
We give an algorithm for two-dimensional pattern matching in the presence of errors. We find that the complexity of our algorithm is O(kn1n2 log n2 + n12n2 + kn1m1m2), where the pattern is an n1 × n2 array, the text is an m1 × m2 array and k is the number of mismatches allowed.
Article Outline
*1 The support of the U.S. Air Force Office of Scientific Research under Contract AFOSR-86-0092 is gratefully acknowledged, as is the help of Sandra German in preparing this paper.
† Permanent Address: Department of Computer Science and Engineering, Indian Institute of Technology, Madras 600036, India.
