A very unique, fast and efficient approach for pattern matching (the Jumping Algorithm)

Abstract

There are a vast number of diversified fields where a pattern may need to be searched in a given string. Processing of signals in telecommunication, finding DNA patterns, searching a word pattern in a document in Microsoft Word document or over the web are some of the examples of pattern matching. The algorithm presented in this paper i.e. Jumping Algorithm is a very new idea for finding a pattern. The algorithm preprocesses the whole string by indexing all the characters of the string and storing the indexes in a two dimensional array. This two dimensional array contains alphabet size number of columns with the index entry for every occurrence of every character of the string. In the matching process the pattern is jumped over the given string until the match is found (or a match doesn't occur). For shifting the pattern on every mismatch, the help of two dimensional array is taken that ensures only relevant shifts. The time complexity for matching processes is very much less than other proposed algorithms because of a very few number of shifts.