Question: Consider two sequences S [1.. n ] and T [1.. m ]. Assume match, mismatch, and indel scores 1, 1, and 2, respectively. Give an
Consider two sequences S[1..n] and T [1..m]. Assume match, mismatch, and indel scores 1, 1, and 2, respectively. Give an algorithm which computes the maximum score of the best alignment (S, T) of S and T, forgiving the space at the beginning of S and the space at the end of T.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
