@article {10.3844/ajassp.2009.78.88,
article_type = {journal},
title = {Efficient Processing for Binary Submatrix Matching},
author = {Sleit, Azzam and AlMobaideen, Wesam and Qatawneh, Mohammad and Saadeh, Heba},
volume = {6},
year = {2009},
month = {Jan},
pages = {78-88},
doi = {10.3844/ajassp.2009.78.88},
url = {https://thescipub.com/abstract/ajassp.2009.78.88},
abstract = {The heavy demand for large volumes of digital data has increased the interest in matrix-like representation. Matrices are well organized data structures which are suitable to store uniform data in order to simplify data access and manipulation. For several applications, the need is critical to efficiently search for a specific pattern in matrix structures. A pattern can be represented as an n-dimensional matrix which can be searched for within other larger n-dimensional matrices.  This query will be referred to as matrix submatching. In this paper, we present and compare two algorithms for binary matrix submatching on the basis of time requirement. The first algorithm is a naive brute force approach with O(n2m2) time requirement. The second approach is based on chain code transformation which reduces the sizes of matrices resulting in less time requirement.},
journal = {American Journal of Applied Sciences},
publisher = {Science Publications}
}