An approach allowing us to improve the locality of a parallel Needleman-Wunsch (NW) global sequence alignment algorithm is proposed. The original NW algorithm works with an arbitrary gap penalty function and examines all possible gap lengths. To compute the score of an element of an NW array, cells gap symbols are looked back over entire row and column as well as one adjacent cell. We modified the NW algorithm so to read cells only with the row-major order by means of forming a copy of the transposed scoring array. The loop skewing technique is used to generate parallel code. A formal parallel NW algorithm is presented. Experimental results demonstrate super-linear speed-up factor of the accelerated code due to considerable increasing code locality on a studied modern multi-core platform.
CITATION STYLE
Pałkowski, M., Siedlecki, K., & Bielecki, W. (2018). Parallel cache efficient algorithm and implementation of Needleman-Wunsch global sequence alignment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10842 LNAI, pp. 207–216). Springer Verlag. https://doi.org/10.1007/978-3-319-91262-2_19
Mendeley helps you to discover research relevant for your work.