Generalized Hidden Markov Model (GHMM)
a | b | c | d | e | f | g | h | i | j | k | l | m | n | o | p | q | r | s | t | u | v | w | x | y | z | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
Click one of the letters above to advance the page to terms beginning with that letter.
- 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)