Viterbi Algorithm
The Viterbi Algorithm is a dynamic programming algorithm that, as a method for decoding the most likely sequence of hidden states in a Hidden Markov Model, distinguishes itself by maximizing the joint probability of the state sequence given a sequence of observations.
1.8K
Publications
123.2K
Citations
3.9K
Authors
1K
Institutions
Publications per year
2017–2026
208
Parents
1.8K
Accelerated Profile HMM Searches
Sean R. Eddy · PLoS Computational Biology · 2011 · 7.5K citations · Full text
G. David Forney · Proceedings of the IEEE · 1973 · 5.7K citations
A Systematic Comparison of Various Statistical Alignment Models
Franz Josef Och, Hermann Ney · Computational Linguistics · 2003 · 3.9K citations · Full text
1–5 of 1.8K
3.9K
13
h-index
13
h-index
13
h-index
12
h-index
11
h-index
1–5 of 3.9K
1K
AT&T (United States)
Bedminster, United States
22 h-index
38 publications
4.6K citations
University of California, Berkeley
Berkeley, United States
20 h-index
26 publications
1.5K citations
Carnegie Mellon University
Pittsburgh, United States
20 h-index
25 publications
1.3K citations
Stanford University
Stanford, United States
19 h-index
24 publications
3.8K citations
RWTH Aachen University
Aachen, Germany
18 h-index
24 publications
5.9K citations
University of California, Los Angeles
Los Angeles, United States
18 h-index
27 publications
1.3K citations
IBM (United States)
Armonk, United States
18 h-index
24 publications
1.2K citations

University of Toronto
Toronto, Canada
17 h-index
20 publications
7.8K citations
1–8 of 1K
137 publications · 11.1K citations
49
h-index
68 publications · 19.3K citations
34
h-index
36 publications · 2.6K citations
24
h-index
41 publications · 1.4K citations
21
h-index
30 publications · 3.4K citations
20
h-index
1–5