Question: Suppose you are given the following items as input: a string A[1..n], a string B[1..m], and the (n + 1) x (m + 1) matrix

Suppose you are given the following items as input: a string A[1..n], a string B[1..m], and the (n + 1) x (m + 1) matrix D produced by the edit distance algorithm. Give an optimal algorithm that constructs an optimal alignment from the input. For example, suppose the input to your algorithm is the string A[1..3] = HAS. string B[1..4] = THIS, and the following matrix D. Then, the output of your algorithm would be the following optimal alignment
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
