The Treeterbi and Parallel Treeterbi algorithms: efficient, optimal decoding for ordinary, generalized and pair HMMs

Motivation: Hidden Markov models (HMMs) and generalized HMMs been successfully applied to many problems, but the standard Viterbi algorithm for computing the most probable interpretation of an input sequence (known as decoding) requires memory proportional to the length of the sequence, which can be...

Full description

Saved in:

Bibliographic Details
Published in:	Bioinformatics Vol. 23; no. 5; pp. 545 - 554
Main Authors:	Keibler, Evan, Arumugam, Manimozhiyan, Brent, Michael R.
Format:	Journal Article
Language:	English
Published:	Oxford Oxford University Press 01.03.2007 Oxford Publishing Limited (England)
Subjects:	Algorithms Biological and medical sciences Chromosomes Chromosomes, Human Computational Biology DNA, Complementary - chemistry Fundamental and applied biological sciences. Psychology General aspects Genes Genomics - methods Humans Markov Chains Mathematics in biology. Statistical analysis. Models. Metrology. Data processing in biology (general aspects) Programming Languages Original document Parallel algorithm Gene Memory Prediction Hidden Markov model Software Web site Bioinformatics Viterbi decoding Comparative study Optimization
ISSN:	1367-4803, 1367-4811, 1367-4811, 1460-2059
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!