In this article we shortly present new string pattern matching algorithm. The algorithm uses novel technique for skipping unnecessary comparisons in pattern searching phase. The pattern searching is applied in almost all branches of science such as bioinformatics, information security, text mining, etc. In the context of continuous increase of data, efficient algorithms are necessary to ensure that one can find a pattern in a sequence in a fast and accurate manner. Pattern searching solves the problem of finding a pattern exhibiting certain properties within a given sequence of symbols. Concept of the new algorithm presented in this article is based on a character index in a pattern, aiming at, but not limited to patterns in DNA sequences.