Parallel Smith-Waterman Algorithm
- Local Sequence Alignment -
myson @ postech.ac.kr CSE700-PL @ POSTECH
Programming Language Laboratory – p.1/14
Parallel Smith-Waterman Algorithm - Local Sequence Alignment - - - PowerPoint PPT Presentation
Parallel Smith-Waterman Algorithm - Local Sequence Alignment - myson @ postech.ac.kr CSE700-PL @ POSTECH Programming Language Laboratory p.1/14 Outline Smith-Waterman algorithm How to parallelize? Parallel Smith-Waterman algorithm A
myson @ postech.ac.kr CSE700-PL @ POSTECH
Programming Language Laboratory – p.1/14
Smith-Waterman algorithm How to parallelize? Parallel Smith-Waterman algorithm A wavefront algorithm A scalable algorithm Variants of a wavefront algorithm
Programming Language Laboratory – p.2/14
Local sequence alignment Sequence similarity comparison ex) S=ATAGCT and T=GATATGCA S =
T = GATATGCA
Programming Language Laboratory – p.3/14
− − G A T A T G C A − A −1 −1 −1 T −2 −2 A −1 −3 −1 −1 −1 G −1 −1 −2 −2 C −1 −3 −1 T −1 −1 −1 −2
Programming Language Laboratory – p.4/14
|S| = n, |T| = m
Programming Language Laboratory – p.5/14
#define Match (-1) #define Mismatch 1 #define Gap 2 Score( i, j ) = ( S[ i ] == T[ j ] ? Match : Mismatch ) A[ i ][ j ] = min (0, A[ i-1 ][ j ] + Gap, A[ i ][ j-1 ] + Gap, A[ i-1 ][ j-1 ] + Score( i, j ))
Programming Language Laboratory – p.6/14
A[ i ][ j ] = min (0, A[ i-1 ][ j ] + Gap, A[ i ][ j-1 ] + Gap, A[ i-1 ][ j-1 ] + Score( i, j ))
Programming Language Laboratory – p.7/14
Programming Language Laboratory – p.8/14
A wavefront algorithm
Programming Language Laboratory – p.9/14
A scalable algorithm
Programming Language Laboratory – p.10/14
Variants of a wavefront algorithm - 1
Programming Language Laboratory – p.11/14
Variants of a wavefront algorithm - 2
Programming Language Laboratory – p.12/14
Programming Language Laboratory – p.13/14
Programming Language Laboratory – p.14/14