using the Needleman and Wunsch dynamic programming method,
construct the partial alignment score table for the following two
sequences, using the following scoring parameters:
match score= +1, Mismatch score= 0, gap penalty= +1
(note: the matrix elements in the Needleman and Wunsch algorithm
are given by
Sj= MAX { Si-1,j-1+ s(aj,bj) (match/mismatch)
Si, j-1 + w (gap in sequence #1)
Si-1, j+2 (gap in sequence #2) }
ACAGTCGAACG
ACCGTCCG
| A | C | A | G | T | C | G | A | A | C | G | ||
| 0 | -1 | -2 | -3 | -4 | -5 | -6 | -7 | -8 | -9 | -10 | -11 | |
| A | ||||||||||||
| C | ||||||||||||
| C | ||||||||||||
| G | ||||||||||||
| T | ||||||||||||
| C | ||||||||||||
| C | ||||||||||||
| G |
ScholarMatic: Explanation & Answer
Your ready answer from a verified tutor is just a click away for as little as $14.99
Click Order Now to get 100% Original Answer Customized to your instructions!
