A new algorithm for local alignment in DNA sequencing

In recent years local alignment for DNA sequencing has obtained great significance. In this paper we propose an algorithm for local alignment between two DNA sequences and compare the performance of the proposed algorithm with Smith-Waterman algorithm. Complexity calculation shows that the proposed algorithm has a much less time complexity and requires very much less amount of memory storage than S-W algorithm.