Parallelized Rabin-Karp method for exact string matching

Exact string matching refers to the search of each and any occurrences of a string in another string. Nowadays, this issue presents itself in various segments in a great deal, starting from standard routines for exact search, which routines are implemented into programs for text editing and processing, through databases and all the way to their various applications in other sciences. One of the sciences where, among other, this kind of search has been applied on a substantial level is biology, and especially in the segment concerning DNA chains. There are numerous different more or less efficient algorithms to solution of this problem. One of more efficient algorithms is Rabin-Karp algorithm, whose complexity is linear. This work provides us with one way to parallelize this algorithm for performance on multiprocessor systems.