Bioinformatics: Implementation of a proposed upgraded Smith-Waterman algorithm for local alignment

This paper presents a new algorithm for local alignment search which has less computational complexity than the Smith-Waterman algorithm. Increasing the accuracy of sequence matching and reducing computational complexity is a grand challenge to bioinformatics computing. The proposed Algorithm is a more competent local alignment searching Algorithm since it reduces running time well enough to search a database in order to find.