503_HW1_S11 - Problem 15-7(a(b Viterbi Algorithm on p...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
UML CS Analysis of Algorithms 91.503 (section 201) Spring, 2011 Homework #1 Assigned : Tuesday, 1/25 Due : Tuesday, 2/1 ( start of lecture) This assignment covers textbook material in Chapter 15 (Dynamic Programming). Attach signed honor statement to your homework (available on course web site). 1. (25 points) Dynamic Programming : Determine an LCS of these two strings: < A, C, T, A, G, T, C, C, G, A, T > and < C, C, A, T, T, G, C, T, A, G, T >. Justify optimality of your answer. 2 . (75 points) Dynamic Programming :
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Problem 15-7 (a)-(b), Viterbi Algorithm on p. 408-409 of our textbook. Please include in your answer: - recursive formulation; - pseudocode written using the conventions on p. 20-22 of the textbook; - correctness justification: o mechanical correctness (loops and recursion terminate correctly, arrays indices stay within bounds, etc.); o “as-advertised” correctness: prove that your pseudocode provides an appropriate path; - upper bound on worst-case asymptotic running time of your pseudocode....
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online