Application of a Modified Convolution Method to Exact String Matching

The problem of exact string matching is to find all locations at which a query of length m matches a substring of a text of length n. In this paper, we first find out all relative suffixes of this query on the text, and we look backward to find out the corresponding prefixes of this query on the text. In order to get this effort, we make use of a wide window(R.1) whose size is equal to 2m-1. Logic operation in CPU is the main process for all calculations. We directly use the logic operations to speed up the matching. Because the query can be represented as the bit vector, we save the space complexity. We get the optimal solution for exact string matching.