Submit Manuscript

Information Technology Journal

Year: 2010 | Volume: 9 | Issue: 3 | Page No.: 453-459
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Article Trend

Total views 1121

Search

Authors

Rami H. Mansi

Jehad Q. Alnihoud

Keywords

Research Article

An Efficient ASCII-Based Algorithm for Single Pattern Matching

Rami H. Mansi and Jehad Q. Alnihoud
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 naïve (brute force) and Boyer-Moore algorithms. In its searching phase, the proposed algorithm improves the shifts in the naïve 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 naïve 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 a result.
PDF Fulltext XML References Citation

Leave a Comment

Your email address will not be published. Required fields are marked *