An efficient framework for accelerating Needleman-Wunsch algorithm using GPU
by Hamza Nadim; Mohamed Assal; Abdelfatah A. Hegazy
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 17, No. 2, 2021

Abstract: The Needleman-Wunsch algorithm is considered the benchmark for global alignment, this work proposes a new implementation for the parallel NW algorithm over the graphical processing unit (GPU). Focusing on enhancing the second phase of the algorithm (The Fill) the most time demanding phase. The idea of filling a percentage of the matrix is presented which guarantees a decrease in execution time, the key was to find the minimum needed percentage to be filled while ensuring the same result as filling the whole matrix of the algorithm. Experiments show the effectiveness of the proposed model in execution time when compared with the sequential algorithm.

Online publication date: Wed, 21-Apr-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bioinformatics Research and Applications (IJBRA):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email