Parallel String Matching Algorithms
Published in Kybernetes • Mar 1, 1988
NobleIDNI9P76W92R10S03
Authors:,
D. J. Evans
Salim Ghanemi
Abstract
The string searching problem is central to many information retrieval and text editing applications. The Brute Force algorithm is inefficient in some cases and in this article four other algorithms are discussed, of which the Boyer‐Moore and the Improved Boyer‐Moore are found to be the fastest. A pa...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!