An improved algorithm for string matching using index based shifting approach

Bioinformatics is now considered as one of the most studied branches in biological science which deals with the exploring of different kinds of methods for analyzing, storing and retrieving biological data, such as protein sequences and nucleic acid (DNA/RNA), configurations, functions, pathways, and genetic relations. In bioinformatics, genomic sequence analysis has led to the evolution of well-organized pattern discovery algorithms to produce search over large DNA sequences. The most important factor for efficiency of a matching algorithm is depending on the total number of character comparisons. Index Based Shift (IBS) algorithm which is the name chosen for our proposed algorithm was tested on different length of DNA sequences data set. The IBS algorithm shows great efficiency in terms of total number of character comparisons it requires than that of ABSBMH algorithm. The experimental result shows that our proposed IBS algorithm works better when length of pattern is increased.