Improved text scanning approach for exact String matching

Exact String matching is an important subject in the domain of text processing and an essential component in practical applications of computer system. In this research we proposed a new algorithm to solve the problem of exact string matching by scanning text string for last and first characters of pattern in its preprocessing phase. In matching phase of TSPLFC (Test Scanning for Pattern Last and First Character) compares pattern with text window from both directions simultaneously. Experimental results verify that TSPLFC is efficient than number of existing algorithms and take its time complexity is O(km) in average case and O(1) in best case.

[1]  P. D. Smith Experiments with a very fast substring search algorithm , 1991, Softw. Pract. Exp..

[2]  Timo Raita,et al.  Tuning the boyer‐moore‐horspool string searching algorithm , 1992, Softw. Pract. Exp..

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

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

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

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

[7]  Richard M. Karp,et al.  Efficient Randomized Pattern-Matching Algorithms , 1987, IBM J. Res. Dev..

[8]  Ababneh M.F. Mohammad,et al.  Occurrences Algorithm for String Searching Based on Brute-force Algorithm , 2006 .

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

[10]  Livio Colussi,et al.  Fastest Pattern Matching in Strings , 1994, J. Algorithms.

[11]  Raffaele Giancarlo,et al.  The Boyer-Moore-Galil String Searching Strategies Revisited , 1986, SIAM J. Comput..

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

[13]  Wojciech Rytter,et al.  Jewels of stringology , 2002 .

[14]  Maxime Crochemore,et al.  Optimal Canonization of All Substrings of a String , 1991, Inf. Comput..

[15]  Daniel Sunday,et al.  A very fast substring search algorithm , 1990, CACM.

[16]  Musbah J. Aqel,et al.  Multiple Skip Multiple Pattern Matching Algorithm (MSMPMA) , 2007 .

[17]  Raffaele Giancarlo,et al.  On the exact complexity of string matching , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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