HMMTeacher

HMMTeacher guides you in the learning of the mechanics of solving the main three HMM algorithms. From the input of the data of a pre-stated HMM, passing by choosing the questions asked and the algorithms to apply, to the final report, containing the step-by-step algorithms solution.

Select the alphabet of the observed sequence of states to use.   Need more help?

Alphabet of observed states: DNA Nucleotides (ACTG) Example of alphabet of observed states for a DNA: ATGGCT Observed DNA sequence (One character per observed symbol. Max length: 20 characters.)

Hidden states:

Alphabet of observed states: One letter code for Proteins (ARNDBCEQZGHILKMFPSTWYV). Example of alphabet of observed states for a protein: MTLDA Observed Protein sequence (One character per observed symbol. Max length: 20 characters.)

Hidden states:

Any custom alphabet, one character per symbol, without separators. Example of alphabet of observed states for a coin, H (Heads) T (Tail): HT Observed Custom sequence (One character per observed symbol. Max length: 20 characters.)

Hidden states:

Input the data   Need more help?

Priors Vector
@

Random initial matrix

Transition matrix

Random transition matrix

Emission matrix

Random emission matrix

Select an algorithm   Need more help?

Whenever you choose the backward algorithm, the forward algorithm is automatically chosen. This, because the backward algorithm need the result of the forward algorithm.
HMM algorithms


Example: H0

Enter the hidden state. (ie 2)