[Solved]Consider Following Hidden Markov Model Hmm Let N 2 M4 Set Observation Symbols C T G Two Q37261433
Consider the following hidden Markov model (HMM). Let N 2 and M4, where the set of observation symbols is “A”, “C”, “T”, and “G”. The two states s1 and 82 capture local features with differing base frequencies. Let the transition probability inatrix A consist of the entries an = 0.5, a12-05, a21- 0.5, a22 0.5. Let the emission probabilities consist of bA(1)-0.25,b(10.25, bc (1)-0.25, bc(1) 0.25,bA(2)-0.1, bT(2)0.1, bc(2)-0.4, b(20.4. Let the initial state distribution be specified by 0.25, T20.75. Suppose that we observed the observation sequence O-CGC and T-3. 1. Fill in the following dynamic programming matrix using the Viterbi algorithm. Show your work to receive credit. There is no need to calculate exact numbers (i.e., to perform arithmetic). You can leave arithmetic expressions in expanded form (e.g., you can write “4*3*2*1 + 2*3” instead of “30”) 81 S2 2. Run the back-tracking algorithm on the completed dynamic programming matrix. Show your back- tracking path 3. What is the sequence of states for the Viterbi-optimal trajectory? Show transcribed image text Consider the following hidden Markov model (HMM). Let N 2 and M4, where the set of observation symbols is “A”, “C”, “T”, and “G”. The two states s1 and 82 capture local features with differing base frequencies. Let the transition probability inatrix A consist of the entries an = 0.5, a12-05, a21- 0.5, a22 0.5. Let the emission probabilities consist of bA(1)-0.25,b(10.25, bc (1)-0.25, bc(1) 0.25,bA(2)-0.1, bT(2)0.1, bc(2)-0.4, b(20.4. Let the initial state distribution be specified by 0.25, T20.75. Suppose that we observed the observation sequence O-CGC and T-3. 1. Fill in the following dynamic programming matrix using the Viterbi algorithm. Show your work to receive credit. There is no need to calculate exact numbers (i.e., to perform arithmetic). You can leave arithmetic expressions in expanded form (e.g., you can write “4*3*2*1 + 2*3” instead of “30”) 81 S2 2. Run the back-tracking algorithm on the completed dynamic programming matrix. Show your back- tracking path 3. What is the sequence of states for the Viterbi-optimal trajectory?
Expert Answer
Answer to Consider the following hidden Markov model (HMM). Let N 2 and M4, where the set of observation symbols is “A”, “C”, “T”,… . . .
OR
