INF 389 Statistical methods in bioinformatics (H2003)
Exercise 5 (Hidden Markov Models)
Problem 1: From Ewens and Grant, Ch. 11: 11.1.
Problem 2: Consider the two-state HMM example (GC-rich, GC-poor)
from the lecture. Apply the Viterbi algorithm to find the most probable
state sequence given the observed sequence (assume uniform initial