Introduction of ProjectAccelerating Viterbi Algorithm

20120306Pei-Ching Li

Outline

• Introduction of Viterbi Algorithm• Example• Reference

Introduction of Viterbi Algorithm

• a dynamic programming algorithm for finding the most likely sequence of hidden states called the Viterbi path.

• HiddenMarkovModel

Example O = Walk->Walk->Shop->Clean

Example O = Walk->Walk->Shop->Clean

Example O = Walk->Walk->Shop->Clean

Example O = Walk->Walk->Shop->Clean

ExampleO = Walk->Walk->Shop->CleanS = Sunny->Sunny->Rainy->Rainy

Reference

• CSE551 Final Project: Parallel Viterbi on a GPU– Authors: Seong Jae Lee, Miro Enev– Provenance: Autumm 2009,

University of Washington

Reference

• A tile-based parallel Viterbi algorithm for biological sequence alignment on GPU with CUDA– Published: Parallel & Distributed Processing,

Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium

– Authors: Zhihui Du, Zhaoming Yin, and David A. Bader

– References Cited: 25