A SHARED MEMORY BASED IMPLEMENTATION OF NEEDLEMAN-WUNSCH ALGORITHM USING SKEWING TRANSFORMATION
Kernel (algebra)
Traverse
DOI:
10.26483/ijarcs.v8i9.4953
Publication Date:
2017-12-25T10:31:56Z
AUTHORS (2)
ABSTRACT
Among various algorithms for protein and nucleotide alignment, Needleman-Wunsch algorithm is widely accepted as it can divide the problem into sub-problems. We present two parallel approaches of with single kernel multi-kernel invocation using skewing transformation which used traversing calculation dynamic programming matrix. also compare these traditional CPU sequential approach resulted in six-fold performance improvement. Furthermore, we same ideology on shared memory two-fold improvement our non-shared approach.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (0)
CITATIONS (0)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....