High Impact Factor : 4.396 icon | Submit Manuscript Online icon |



Kanumporn Asawasiriroj , Mahidol University


String Matching, Pattern Matching, Exact String Matching, Single Pattern, Character Comparison


String matching is a fundamental problem in computer science. The main problem is to find all occurrences in the text file. Normally, string matching algorithms consist of two processes. First is the comparison between each character of a pattern and a substring. Second is to determining the position of the next comparison. Those are called the pre-processing phase and the searching phase. In the searching phase if increase the shifting value, the algorithm must has more performance. This thesis has improved the algorithm by choosing the maximum of shift value and apply with Raita compare ordering technique. The testing environments are simulated and the results are compared with other traditional algorithms and many types of text files used too. From the experimental results, the improved algorithm outperformed other string matching algorithms currently in use in all cases of text files that are tested in this research.

Other Details

Paper ID: IJSRDV2I9362
Published in: Volume : 2, Issue : 9
Publication Date: 01/12/2014
Page(s): 809-815

Article Preview

Download Article