Connection between Viterbi, Needleman Wunsch and Baum-Welch Algorithm
I am trying to understand the connection between viterbi, NW and Baum Welch.
From my understanding, NW is the Viterbi algorithm applied to a pair HMM.
So given two sequences, you will obtain the optimal alignment.
Now my question is whether there is something analogous to the Baum-Welch algorithm for the pair HMM.
If there exists one, what is it called and what does it output?
If Viterbi for pair HMMs outputs the optimal alignment given two sequences then will the BW equivalent optimize the pair HMM parameters given the 2 sequences?
• 1,105 views
•
link
written
by
trinityduke100 •
0 answers
No answers yet.
Log in to answer this question.
More posts like this
-
Training a layered HMM
written by trinityduke100 •
-
Finding suboptimal alignments
written by trinityduke100 •
-
Equivalent of Waterman-Eggert Algorithm
written by trinityduke100 •
-
Profile HMM to find sequence motif using Baum-Welch instead of using a given multiple sequence alig…
written by guixien •
-
Retrieve sequences that generated a HMM profile
written by frcamacho
-
multiple sequence alignment using HMM and simulated annealing
written by Rojhin •
-
Statistical Significance of Hidden Markov Models
written by JW •
-
Biojava HMM error
written by Jamand
-
MSA following hmmalign/hmmsearch?
written by db534 •
-
Stand Alone Software Equivalent To Framebot
written by Woa
