Enhanced Two Sliding Windows Algorithm For Pattern Matching (ETSW)

In this paper, we propose a string matching algorithm - Enhanced Two Sliding Windows (ETSW), which made an improvement on the Two Sliding Windows algorithm (TSW). The TSW algorithm scans the text from both sides simultaneously using two sliding windows. The ETSW algorithm enhances the TSW's process by utilizing the idea of the two sliding windows and focusing on making comparisons with the pattern from both sides simultaneously. The comparisons done between the text and the pattern are done from both sides in parallel. The experimental results show that the ETSW algorithm has enhanced the process of pattern matching by reducing the number of comparisons performed. The best time case is calculated and found to be while the average case time complexity , where m is the pattern length and n in the text length.

[1]  Thierry Lecroq,et al.  Fast exact string matching algorithms , 2007, Inf. Process. Lett..

[2]  N. Balakrishnan,et al.  A FAST Pattern Matching Algorithm , 2004, J. Chem. Inf. Model..

[3]  Amjad Rehman,et al.  DOCUMENT SKEW ESTIMATION AND CORRECTION: ANALYSIS OF TECHNIQUES, COMMON PROBLEMS AND POSSIBLE SOLUTIONS , 2011, Appl. Artif. Intell..

[4]  Dima Suleiman,et al.  A Fast Pattern Matching Algorithm with Two Sliding Windows (TSW) , 2008 .

[5]  Esko Ukkonen,et al.  Approximate Boyer-Moore String Matching , 1993, SIAM J. Comput..

[6]  Yang Wang.  On the shift-table in Boyer-Moore's String Matching Algorithm , 2009, J. Digit. Content Technol. its Appl..

[7]  Devaki Pendlimarri,et al.  Novel Devaki-Paul Algorithm for Multiple Pattern Matching , 2011 .

[8]  Frantisek Franek,et al.  A simple fast hybrid pattern-matching algorithm , 2007, J. Discrete Algorithms.

[9]  Gonzalo Navarro,et al.  String matching with alphabet sampling , 2012, J. Discrete Algorithms.

[10]  Binxing Fang,et al.  The wide window string matching algorithm , 2005, Theor. Comput. Sci..

[11]  R. Nigel Horspool,et al.  Practical fast searching in strings , 1980, Softw. Pract. Exp..

[12]  Jorma Tarhio.  A Boyer-Moore Approach for Two-Dimensional Matching , 1993 .

[13]  Amjad Rehman,et al.  Evaluation of artificial intelligent techniques to secure information in enterprises , 2012, Artificial Intelligence Review.

[14]  Thomas Berry,et al.  A Fast String Matching Algorithm and Experimental Results , 1999, Stringology.

[15]  Ibrahiem M. M. El Emary,et al.  A New Approach for Solving String Matching Problem through Splitting the Unchangeable Text , 2008 .

[16]  Nen-Fu Huang,et al.  NIS04-6: A Time- and Memory- Efficient String Matching Algorithm for Intrusion Detection Systems , 2006, IEEE Globecom 2006.

[17]  Rezaul Alam Chowdhury,et al.  A New String Matching Algorithm , 2003, Int. J. Comput. Math..

[18]  Shokoufeh Seifi,et al.  Improved Pattern Matching Algorithm for Intrusion Detection System , 2013 .

[19]  Yanggon Kim,et al.  A Fast Multiple String-Pattern Matching Algorithm , 1999 .

[20]  Robert S. Boyer,et al.  A fast string searching algorithm , 1977, CACM.

[21]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[22]  Amjad Rehman,et al.  Methods and strategies on off-line cursive touched characters segmentation: a directional review , 2014, Artificial Intelligence Review.

[23]  Wojciech Plandowski,et al.  Speeding up two string-matching algorithms , 2005, Algorithmica.

[24]  Devaki Pendlimarri,et al.  Novel Pattern Matching Algorithm for Single Pattern Matching , 2010 .

[25]  Z. Galil,et al.  Pattern matching algorithms , 1997 .