A Coarse-to-Fine Approach to Computing the k-Best Viterbi Paths

DOI10.1007/978-3-642-21458-5_32zbMath1339.68228OpenAlexW2281825358MaRDI QIDQ3011869

No author found.

Publication date: 29 June 2011

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21458-5_32

zbMATH Keywords

hidden Markov models (HMM)coarse-to-fine\(k\)-best Viterbi path

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Uses Software

• PennCNV

Cites Work

• Quad trees: A data structure for retrieval by composite keys
• Hidden Markov models approach to the analysis of array CGH data

This page was built for publication: A Coarse-to-Fine Approach to Computing the k-Best Viterbi Paths