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

Alphabet of observed states: DNA Nucleotides (ACTG)

Observed DNA sequence (One character per observed symbol. Max length: 20 characters.)

Hidden states:

Alphabet of observed states: One letter code for Proteins (ARNDBCEQZGHILKMFPSTWYV).

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

Priors Vector
@

Random initial matrix

Transition matrix

Random transition matrix

Emission matrix

Random emission matrix

Select an algorithm

HMM algorithms


Example: H0

Enter the hidden state. (ie 2)