hw14_key

pdf

School

Harvard University *

*We aren’t endorsed by this school

Course

224

Subject

Computer Science

Date

Jan 9, 2024

Type

pdf

Pages

2

Uploaded by CountHeron146

Report
Homework Assignment #14 KEY Question 1 (5) : Gene Alignment with Edit Distance Find the optimal alignment using dynamic programming (by hand) of ATCGT and AGTCGA . Show your complete Dynamic Programming table. Include the edit distance score of each cell and show the back pointer(s) from each cell. What is the Edit Distance of the 2 strings? -6 Is there more than one optimal alignment? No Bold the back pointers along the optimal path from the goal cell. Show the alignment of the two strings with the first above the second. AGTCGA A–TCGT Question 2 (5) : Knapsack with repetition Use dynamic programming to fill a knapsack without repetition having a maximum weight capacity of 10 units with a load of maximum value from the following objects:
Object Weight Value A 1 1 B 2 7 C 5 11 D 6 21 E 7 31 Maximum value at weight w 0 1 2 3 4 5 6 7 8 9 10 K(w) 0 1 7 8 8 11 21 31 32 38 39 The maximum value is 39 and that knapsack configuration comprises {E, B, A}.
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help