Parallel String Matching Algorithms
Copyright policy )Parallel String Matching Algorithms
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.
- Loughborough University United Kingdom
- Badji Mokhtar University Algeria
pattern matching, parallel algorithm, Software, source code, etc. for problems pertaining to computer science, string searching, MIMD parallel computer systems, Searching and sorting
pattern matching, parallel algorithm, Software, source code, etc. for problems pertaining to computer science, string searching, MIMD parallel computer systems, Searching and sorting
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!