Question: Using Java or C, C# Write a program that solves the Local Sequence Alignment problem using dynamic programming. (20 points) The input includes strings v,
Using Java or C, C#
Write a program that solves the Local Sequence Alignment problem using dynamic programming. (20 points) The input includes strings v, w and a scoring matrix ?. The output is an alignment of v and w whose score (as defined by the matrix ) is maximal among all possible alignments of v and w. 1. Run your program to find the optimal local alignment for 1213434222 and 1343422421 under the match premium +1, mismatch penalty -1, and indel penalty -0.5
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
