Entering edit mode
3.8 years ago
alan.jacob21
•
0
using dynamic programming of the global alignment. Use match score = 1, Gap Penalty = -1, and mismatch penalty = -1. Show the optimal path taken at each step in the matrix. Show the optimal alignment obtained