Abstract

A new algorithm is presented which takes advantage of the statistical distribution of characters within the search pattern to eliminate any computational processes during the search phase. Through pre-processing the search pattern a look up table is generated which incorporates the entire shifting rules of the algorithm. Preliminary results shows the new algorithm out performing existing general algorithms, as the pattern becomes large for natural English text and when searching a small alphabet source (DNA).