The viterbi algorithm
Proceedings of the IEEE · 1973 · 5,806 citations
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Forney, G. D. (1973). The viterbi algorithm. Proceedings of the IEEE, 61(3), 268–278. https://doi.org/10.1109/proc.1973.9030
In text: (Forney, 1973)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
Abstract
The Viterbi algorithm (VA) is a recursive optimal solution to the problem of estimating the state sequence of a discrete-time finite-state Markov process observed in memoryless noise. Many problems in areas such as digital communications can be cast in this form. This paper gives a tutorial exposition of the algorithm and of how it is implemented and analyzed. Applications to date are reviewed. Increasing use of the algorithm in a widening variety of areas is foreseen.
Related papers
- Gapped BLAST and PSI-BLAST: a new generation of protein database search programs1997
- Ultrafast and memory-efficient alignment of short DNA sequences to the human genome2009
- MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform2002
- Introduction to Algorithms1991
- Fast and accurate long-read alignment with Burrows–Wheeler transform2010
Metadata from OpenAlex (CC0). Citations are generated from the published record.