#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:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/14548 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | 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. |
|---|