Journal of Computational Intelligence in Bioinformatics

Pattern matching is a pivotal theme in computer research because of its relevance to various applications such as web search engines, computational biology, virus scan software, network security and text processing. Pattern matching emerges as a power full tool in locating nucleotides or amino acid in the biological sequence databases. Presently, several pattern-matching algorithms are available; however the efficiency of the various algorithms depends on faster and exact identification of the pattern in the text. In this paper we have proposed a new exact patternmatching algorithm for biological sequences. The experimental results show that the new algorithm is faster than other algorithms being compared here for small alphabet set and long patterns. The proposed algorithm is quite applicable for pattern matching in biological sequences.