Wikipedia:Reference desk/Archives/Mathematics/2018 November 24

= November 24 =

Replacing Viterbi algorithm with a graph algorithm
Viterbi algorithm is used to find the most likely sequence under HMM model. If we unfold the state transition over time, we obtain latent states graph (trellis). Is the problem Viterbi solves equivalent to finding the longest (heaviest) path in this graph? — Preceding unsigned comment added by 87.70.103.141 (talk) 20:28, 24 November 2018 (UTC)
 * Courtesy links: HMM, Viterbi algorithm. I found an article which may be useful. --RDBury (talk) 11:05, 25 November 2018 (UTC)