Description

Exact string matching algorithms are essential components in DNA applications of the computational biology. Pattern matching is an important task of the pattern discovery process in today’s world for finding the structural and functional behaviour in proteins and genes. Although pattern matching is commonly used in computer science and information processing, it can be found in everyday tasks. Molecular biologists often search for the important information from the databases in different directions of different uses. With the increasing need for instant information, pattern matching will continue to grow and change as needed from time to time. In this research we propose a new pattern matching technique called an Exact multiple pattern matching algorithms using DNA sequence and pattern pair. The current approach is used to avoid unnecessary comparisons in the DNA sequence. Due to this, the number of comparisons gradually decreases and comparison per character ratio of the proposed algorithm reduces accordingly when compared to the some of the existing popular methods. Proposed algorithm is implemented and compared with existing algorithms. Comparison results demonstrate that index based algorithm is efficient than the number of the existing techniques.