Options
Efficient two-dimensional pattern matching in the presence of errors
Date Issued
01-01-1987
Author(s)
Krithivasan, Kamala
Sitalakshmi, R.
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. © 1987.
Volume
43