Viterbi algorithm

(45 minutes to learn)


The Viterbi algorithm is an algorithm for finding the most likely state sequence in the posterior for an HMM. It is based on dynamic programming and has linear time complexity in the length of the sequence.


This concept has the prerequisites:

Core resources (read/watch one of the following)


See also