A Fast Pattern Matching Algorithm with Two Sliding Windows (TSW) | Science Publications

Journal of Computer Science

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

关键词: Pattern matching;    string matching;    berry-ravindran algorithm;    boyer moore;   

DOI  :  10.3844/jcssp.2008.393.401

学科分类：计算机科学（综合）

来源: Science Publications

【 摘 要 】

In this research, we propose a fast pattern matching algorithm: The Two Sliding Windows (TSW) algorithm. The algorithm makes use of two sliding windows, each window has a size that is equal to the pattern length. Both windows slide in parallel over the text until the first occurrence of the pattern is found or until both windows reach the middle of the text. The experimental results show that TSW algorithm is superior to other algorithms especially when the pattern occurs at the end of the text.

【 授权许可】

Unknown