Question: Question 1: (5) Find the optimal alignment using dynamic programming (by hand) of ATGCC and TACGCA. Use the Needleman-Wunsch cost function that you will use

Question 1: (5) Find the optimal alignment using dynamic programming (by hand) of ATGCC and TACGCA. Use the Needleman-Wunsch cost function that you will use for the project, namely: Cindel = 5; Csub = 1; and match = -3. Show your DP table. Circle the optimal alignment cost. Extract the optimal alignment(s) from the table (keep back-pointers in the table if you want)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
