Question: use the local alignment ( Smith - Waterman algorithm ) to manually find a best LOCAL ALIGNMENT of two sequences S 1 = GCATTGCC and

use the local alignment (Smith-Waterman algorithm) to manually find a best LOCAL ALIGNMENT of two sequences S1= GCATTGCC and S2= ACATTCCG. (The dynamic programming table, backtracking process, and final alignment are needed.)
I just need help filling in the dynamic programming table.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!