Parallelization of Needleman-Wunsch Algorithm Based on Software Pipelining
Author(s) -
Han-Wen Hu,
Zhenzhou Ji
Publication year - 2011
Publication title -
international journal of engineering and manufacturing
Language(s) - English
Resource type - Journals
eISSN - 2306-5982
pISSN - 2305-3631
DOI - 10.5815/ijem.2011.04.09
Subject(s) - computer science , sequence (biology) , software , algorithm , parallel computing , multiple sequence alignment , sequence alignment , field (mathematics) , speedup , peptide sequence , mathematics , programming language , biochemistry , genetics , chemistry , gene , pure mathematics , biology
Sequence alignment is one of the most important algorithms that analyzing massive biological information. In modern bioinformatics, it plays an important role in field of serching for similar sequences, predicting sequence information of unkown sequence, looking for specific position of sequence, predicting protein structure and so on. Needleman-Wunsch algorithm is the earliest global alignment algorithm, it gets widely application with its accuracy, however, it has a high time complexity and its speed is slower. This paper adopts software pipelining technique to optimize Needleman-Wunsch algorithm with parallelization, and OpenMP which is the industrialized standard of shared memory programming is used to parallelize it. The performance of Needlelman-Wunsch algorithm can get a great improvement with the optimization.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom