package ac.essex.gp.markov;

/**
 * The hardest problem associated with HMMs is to take a sequence of
 * observations, known to represent a set of hidden states and fit the most probable
 * HMM.
 *
 * Solved using the forward-backward algorith,
 *
 * The algorithm proceeds by making an initial guess at the parameters
 * and then refining it by assessing its worth and attempting to reduce the errors
 * it provokes when fitted to the given data.
 *
 * 
 *
 * @author Olly Oechsle, University of Essex, Date: 05-Mar-2007
 * @version 1.0
 */
public class ForwardBackwardAlgorithm {
}