Difference between revisions of "CH391L/HiddenMarkovModel"
From Marcotte Lab
< CH391L
(Created page with "== Viterbi Algorithm == This is an 'dishonest casino' example from Durbin, et al. 'Biological Sequence Analysis' book. A casino used two types of dice: one is a 'fair' one that h...") |
(→Viterbi Algorithm) |
||
| Line 2: | Line 2: | ||
This is an 'dishonest casino' example from Durbin, et al. 'Biological Sequence Analysis' book. A casino used two types of dice: one is a 'fair' one that has equal chance to all six numbers, and the other is a 'dishonest' one that has high chance of number 6 than the others. We have a sequence of dice numbers from the casino, and want to estimate when a dealer exchanged the dice. | This is an 'dishonest casino' example from Durbin, et al. 'Biological Sequence Analysis' book. A casino used two types of dice: one is a 'fair' one that has equal chance to all six numbers, and the other is a 'dishonest' one that has high chance of number 6 than the others. We have a sequence of dice numbers from the casino, and want to estimate when a dealer exchanged the dice. | ||
| − | We assume that the Hidden Markov Model of this example as below: | + | We assume that the Hidden Markov Model of this example as below: |
| − | http://www. | + | http://www.marcottelab.org/users/CH391L/FromTA/HMM_dice.png |
| − | + | ||
---- | ---- | ||
[[Category:CH391L]] | [[Category:CH391L]] | ||
Revision as of 11:25, 19 February 2011
Viterbi Algorithm
This is an 'dishonest casino' example from Durbin, et al. 'Biological Sequence Analysis' book. A casino used two types of dice: one is a 'fair' one that has equal chance to all six numbers, and the other is a 'dishonest' one that has high chance of number 6 than the others. We have a sequence of dice numbers from the casino, and want to estimate when a dealer exchanged the dice.
We assume that the Hidden Markov Model of this example as below:
