|
|
| 1. Use your knowledge of the longest common subsequence algorithm to perform a global alignment between AATGC and AATGA. Show your alignment to the instructor. What is the score for the optimal path? Use the following payoff matrix: Sij = 1 for match, Sij = 0 for mismatch, w = 0 for gap penalty. |
| Return to the Bioinformatics Home Page |