Parallel String Matching Algorithms
D.J. Evans
(Loughborough University of Technology, UK)
S. Ghanemi
(Annaba University, Algeria)
83
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 parallel implementation using the divide and conquer method is examined. Comparisons using the MIMD‐type parallel computer systems are presented.
Keywords
Citation
Evans, D.J. and Ghanemi, S. (1988), "Parallel String Matching Algorithms", Kybernetes, Vol. 17 No. 3, pp. 32-44. https://doi.org/10.1108/eb005791
Publisher
:MCB UP Ltd
Copyright © 1988, MCB UP Limited