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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Bioinformatics Ročník 23; číslo 5; s. 545 - 554
Hlavní autoři:	Keibler, Evan, Arumugam, Manimozhiyan, Brent, Michael R.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Oxford University Press 01.03.2007 Oxford Publishing Limited (England)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!