A hidden Markov model combines start, transition, and emission probabilities.
The model has hidden states and emissions
The HMM has two hidden states: I for CpG island and N for normal background. Each state emits G or A.
hidden path⟶observed sequence
Decoding asks for the most likely path
Given the observed sequence, Viterbi decoding finds the single hidden state path with the largest joint probability.
argpathmaxP(path,observations)