By Topic

Improved bit-parallel string matching algorithm overcoming computer word size limitation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Sharma, A.K. ; Dept. of CSE, MNNIT, Allahabad, India ; Singh, A. ; Agarwal, S. ; Pandey, K.L.
more authors

Algorithms that uses bit-wise operations are known as bit-parallel algorithms. Technique of bit-parallelism has been very useful in string matching area since the introduction of the Shift-Or algorithm. In this algorithm, the input pattern length (m) is required to be less than the computer word size (W) to benefit from the full power of bit-parallelism. In the past, BLIM (Bit-parallel length independent matching) has been used to solve this word length problem efficiently. In this study, we propose a method that improves the efficiency of the BLIM algorithm further. This algorithm uses multiple characters to compute the value by which each text window is to be shifted during matching. Experimental results indicate that the proposed algorithm is faster than BLIM algorithm while retaining its main advantage.

Published in:

Recent Advances in Information Technology (RAIT), 2012 1st International Conference on

Date of Conference:

15-17 March 2012