Boukerche, A., Melo, A.C.M.A., Ayala-Rincon, M. and Santana, T.M. (2005) Parallel Smith-Waterman Algorithm for Local Dna Comparison in a Cluster of Workstations. Experimental and Efficient Algorithms, 3503, 464-475. www.springerlink.com/content/xwn2q2qfm4hgvr3t

has been cited by the following article:

• TITLE: Comparative Study of the Parallelization of the Smith-Waterman Algorithm on OpenMP and Cuda C

  AUTHORS: Amadou Chaibou, Oumarou Sie

  KEYWORDS: Cuda, GP-GPU, OpenMP, Parallel Computing, Smith-Waterman

  JOURNAL NAME: Journal of Computer and Communications, Vol.3 No.6, June 18, 2015

  ABSTRACT: In this paper, we present parallel programming approaches to calculate the values of the cells in matrix’s scoring used in the Smith-Waterman’s algorithm for sequence alignment. This algorithm, well known in bioinformatics for its applications, is unfortunately time-consuming on a serial computer. We use formulation based on anti-diagonals structure of data. This representation focuses on parallelizable parts of the algorithm without changing the initial formulation of the algorithm. Approaching data in that way give us a formulation more flexible. To examine this approach, we encode it in OpenMP and Cuda C. The performance obtained shows the interest of our paper.