An efficient ASCII-based algorithm for single pattern matching

In this study, we propose a new single exact pattern matching algorithm, called ASCII-Based-RJ algorithm. Furthermore, a string matching tool (RJ-SMT) has been developed to simulate and test the proposed algorithm, the naive (brute force) and Boyer-Moore algorithms. In its searching phase, the proposed algorithm improves the shifts in the naive and Boyer-Moore algorithms by excluding the text's segments that contain a different character from pattern's characters. Based on the experimental results, the ASCII-Based-RJ algorithm outperformed the naive algorithm by 35.3% and Boyer-Moore algorithm by 2.3%. We may conclude that adding some restrictions, or conditions, on text's characters during the preprocessing phase, increases the efficiency of the searching phase, which increases the efficiency of the algorithm as aresult. © 2010 Asian Network for Scientific Information.