Author(s)

Amjad Hudaib¹, Rola Al-Khalid¹, Aseel Al-Anani¹, Mariam Itriq², Dima Suleiman²

¹Department of Computer Information Systems, King Abdullah II School for Information Technology, The University of Jordan, Amman, Jordan.
²Department of Business Information Technology, King Abdullah II School for Information Technology, The University of Jordan, Amman, Jordan.

This paper presents an efficient pattern matching algorithm (FSW). FSW improves the searching process for a pattern in a text. It scans the text with the help of four sliding windows. The windows are equal to the length of the pattern, allowing multiple alignments in the searching process. The text is divided into two parts; each part is scanned from both sides simultaneously using two sliding windows. The four windows slide in parallel in both parts of the text. The comparisons done between the text and the pattern are done from both of the pattern sides in parallel. The conducted experiments show that FSW achieves the best overall results in the number of attempts and the number of character comparisons compared to the pattern matching algorithms: Two Sliding Windows (TSW), Enhanced Two Sliding Windows algorithm (ETSW) and Berry-Ravindran algorithm (BR). The best time case is calculated and found to be  while the average case time complexity is  .

Pattern Matching, FWS, Enhanced Two Sliding Windows Algorithm, RS-A Fast Pattern Matching Algorithm

Hudaib, A. , Al-Khalid, R. , Al-Anani, A. , Itriq, M. and Suleiman, D. (2015) Four Sliding Windows Pattern Matching Algorithm (FSW). Journal of Software Engineering and Applications, 8, 154-165. doi: 10.4236/jsea.2015.83016.