Local sequence alignment. Often two DNA sequences are significantly different, but contain regions that are very similar and are highly conserved. Design an algorithm that takes an input two strings x[1... n] and y[1... m] and a scoring matrix & (as defined in Exercise 6.26), and outputs substrings x ‘ and y , of x and y, respectively, that have the highest-scoring alignment over all pairs of such substrings. Your algorithm should take time O(mn).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.