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

1. Use the LCS algorithm to compute the best sequence alignment between some DNA strings, which…

1. Use the LCS algorithm to compute the best sequence alignment between some DNA strings, which…

1. Use the LCS algorithm to compute the best sequence alignment between some DNA strings, which you can get online from GenBank.2. Develop a spell-checker that uses edit distance (see Exercise C-13.43) to determine which correctly spelled words are closest to a misspelling.Exercise C-13.43Define the edit distance between two strings X and Y of length n and m, respectively, to be the number of edits that it takes to change X into Y. An edit consists of a character insertion, a character deletion, or a character replacement. For example, the strings “algorithm” and “rhythm” have edit distance 6. Design an O(nm)-time algorithm for computing the edit distance between X and Y.