Generalized Hidden Markov Model (GHMM) 


Generalized Hidden Markov Model (GHMM) search for term

« generative » model of HMM, each element generating, or emiting, an interval of the input sequence (sequence of a particular type). The problem of identifying the highest scoring parse with a GHMM is termed decoding, and can be accomplished efficiently using a dynamic programming procedure, based on the shortest path algorithm. Popular GHMM-based gene finders are GENSCAN, AUGUSTUS, GlimmerHMM and SNAP. (Edwards 2009)