+1 (218) 451-4151
glass
pen
clip
papers
heaphones

1. Write a program that takes two character strings (which could be, for example, representations…

1. Write a program that takes two character strings (which could be, for example, representations…

1. Write a program that takes two character strings (which could be, for example, representations of DNA strands) and computes their edit distance, based on your algorithm from the previous exercise.  2. Let X and Y be strings of length n and m, respectively. Define B(j,k) to be the length of the longest common substring of the suffix X[n− j..n−1] and the suffix Y[m − k..m − 1]. Design an O(nm)-time algorithm for computing all the values of B(j,k) for j = 1,…,n and k = 1,…,m.