Problem
Consider the sequences v = TACGGGTAT and w = GGACGTACG. Assume that the match score is +1, and the mismatch and gap penalties are -1.
• Fill out the dynamic programming table for a global alignment between v and w. Draw arrows in the cells to store traceback information. What is the score of the optimal global alignment and what alignment(s) achieves this score?
• Fill out the dynamic programming table for a local alignment between v and w. Draw arrows in the cells to store traceback information. What is the score of the optimal local alignment in this case and what alignment(s) achieves this score?