Time efficient novel parallel technique for Needleman Wunsch and Smith Waterman algorithms

Needleman-Wunsch and Smith-Waterman algorithms are the basic bioinformatics algorithms used for the sequence alignments. Algorithms used the dynamic programming approach and take large time and space to compute the alignments. This paper presents the parallelization of the both algorithms over multiple threads using novel technique of loop transformation. Algorithms serial & parallel version time analysis is performed to show the speed up achieved for both algorithms using the new parallelizing approach.