#TITLE_ALTERNATIVE#
Viterbi algorithm is a method to solve main problem in Hidden Markov Model, which is to find the most probable sequence of hidden states. This algorithm has some benefit such as short time needed, systematic step, and the decision of algorithm’s output is based on the whole sequence. However, thi...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Final Project |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/14548 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Institut Teknologi Bandung |
| 語言: | Indonesia |
| 總結: | Viterbi algorithm is a method to solve main problem in Hidden Markov Model, which is to find the most probable sequence of hidden states. This algorithm has some benefit such as short time needed, systematic step, and the decision of algorithm’s output is based on the whole sequence. However, this algorithm only can find the most probable sequence of hidden states. Thus, the other probable hidden state can not be showed in this algorithm. For example, data of gen plasmodium falciparum CDS will be taken for finding its hidden state (exon and intron). MATLAB R2010a software will be used to proceed viterbi agorithm. |
|---|