By Topic

A parallel string search algorithm

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

3 Author(s)
Takefuji, Y. ; Dept. of Electr. Eng., Case Western Reserve Univ., Cleveland, OH, USA ; Tanaka, T. ; Lee, K.C.

A new parallel processing algorithm for solving string search problems is presented. The proposed algorithm uses O(m×n) processors where n is the length of a text and m is the length of a pattern. It requires two and only two iteration steps to find the pattern in the text, while the best existing parallel algorithm needs the computation time O(loglog n)

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:22 ,  Issue: 2 )