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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Bioinformatics Research and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
