Intelligent Predictive String Search Algorithm Using Two Sliding Windows in Parallel Environment

Abstract

String matching is a fundamental problem in computer science and has been extensively studied. Searching for all occurrences of a pattern in a text is a fundamental problem in many applications, like natural language processing, information retrieval, pattern recognition and computational biology. Many string matching algorithms are existing and work efficiently with different applications in different life scopes; one of these algorithms is the Intelligent Predictive String Search Algorithm, this algorithm searches through a given text to find the first occurrence of a pattern without a pre-processing phase that included in many string marching algorithms to calculate the pattern shift values which lead less computations and uses simple rules during a match or mismatch of a pattern character using one sliding window.In this paper we updated the Intelligent Predictive String Search Algorithm three times resulting with three versions; in the first one we reversed the search direction to be from right using one sliding window while in second version we use two sliding windows to scans the text from both sides sequentially and finally we parallelize this version using real parallel environment. Besides, it is easy to parallelize the new developed algorithm gain significant enhancement in decreasing time and memory requirements.

A survey on improving pattern matching algorithms for biological sequences

“…Boyer-Moore algorithm 9 The Boyer-Moore (BM) approach [10][11][12][13][14][15][16][17][18][19][20][21][22][23][24] is frequently used in the software industry. The right-to-left scan, the bmBc shift rule, and the bmGs shift rule are three ingenious concepts used by the Boyer-Moore algorithm.…”

“…The Knuth-Morris-Pratt (KMP) method, 6,13,22,23,28,36,40,52,57,58 developed by Knuth et al accomplishes the left-side comparison. When a match is not occurs, KMP shifts the sliding window to the right, keeping the matched text's suffix and the pattern's prefix as close as possible.…”