The Viterbi algorithm is a powerful dynamic programming approach for optimal path searching based on a hidden markov model. Tommy has written a working version of the Viterbi algorithm, but the code needs to be reformatted and incorporated into the brainlit package. I'll add the file under /algorithms/connect_fragments/dynamic_programming_viterbi.py
The Viterbi algorithm is a powerful dynamic programming approach for optimal path searching based on a hidden markov model. Tommy has written a working version of the Viterbi algorithm, but the code needs to be reformatted and incorporated into the brainlit package. I'll add the file under /algorithms/connect_fragments/dynamic_programming_viterbi.py