Two-Dimensional Bitwise Memory Matrix: A Tool for Optimal Parallel Approximate Pattern Matching⋆

Abstract. A very fast parallel approach to pattern matching is presented. The ap-proach is based on the bit-parallel approach and we use two-dimensional bitwise mem-ory matrix which helps to achieve very fast parallel pattern matching algorithms. The parallel pattern matching takes O(1) time for the exact pattern matching and O(k) for the approximate pattern matching, where k is the number of errors.