High performance pattern search algorithm using three sliding windows

In this work we propose a new pattern matching algorithm based on the principle of the text segmentation by slicing the text in to three segments. The idea is to perform preprocessing of pattern strings before beginning to search for the pattern in the text so as to achieve substantial speed up in the search process as against to other existing algorithms which either preprocess text or pattern or does no preprocessing such as Brute Force algorithm. The behavior of the algorithm depends on the occurrence of consecutive characters in the event of pattern failure. In this paper we present an efficient pattern matching algorithm based on preprocessing of the pattern string by considering three consecutive characters of the text that immediately follow the aligned pattern window in an event of mismatch between pattern and text character. The algorithm makes use of three sliding patterns. The experimental results show that the proposed algorithm is superior to other algorithms even when the pattern is in the end of the text.