1add1 neighborsdone1 1add1 set up boundaries

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: hamberlain Step 1: IniIalize boundaries to 0 73 Smith- Waterman Dynamic Programming Approach: 0 1 2 3 4 5 6 7 8 0 0 0 0 0 0 0 0 0 0 1 0 2 0 3 0 etc. 4 0 5 0 6 0 7 0 8 0 CSEP 524: Parallel ComputaIon Winter 2013: Chamberlain Step 2: Compute cells as we’re able to Hi- 1,j- 1 Hi,j- 1 Hi- 1,j Hi,j 74 Smith- Waterman Dynamic Programming Approach: 0 1 2 3 4 5 6 7 8 0 0 0 0 0 0 0 0 0 0 1 0 2 1 2 1 2 1 0 2 2 0 1 1 1 1 1 1 0 1 3 0 0 3 2 3 2 3 2 1 4 0 2 2 5 4 5...
View Full Document

Ask a homework question - tutors are online