The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Apr 2017 |
| Last Sign in: | 103 Weeks Ago, 3 Days Ago |
| Questions Answered: | 4870 |
| Tutorials Posted: | 4863 |
MBA IT, Mater in Science and Technology
Devry
Jul-1996 - Jul-2000
Professor
Devry University
Mar-2010 - Oct-2016
Alignment of DNA sequences
In HW1, you have written a program that computes the Hamming distance between two DNA sequences (strings in the alphabet of {A,T,C,G}) of the same length. The Hamming distance, however, is barely used for measuring the similarity/difference between DNA sequences. Edit distance (or some kind variant of edit distance) is one of the commonly used metrics for measuring how dissimilar two DNA sequences (or any strings) are to one another. The edit distance between two strings is defined as the minimum number of operations (insertion, deletion, and replacement) required to transform one string into the other. Edit distance calculation is a classic problem that can be solved using a dynamic programming algorithm (check out the notes). For this assignment, you will implement a Java class for computing edit distance between two strings. Your program needs to read two strings (one string per line) from a local text file, compute, and report the edit distance between the sequences.
Here is a screenshot in the attach file for this assignment details.
Â
-----------