Takes two genetic sequences as a string and finds their similarity. Produce a numerical score by giving a penalty if there is a gap (2) and mismatch (1). • Implemented with dynamic programming to find the optimal alignment of two genetic sequences. • Program makes use of a 2D array to keep track of the cost between the two sequences

To test program you need Sedgewick and Wayne's Algorithms library Follow instructions using this site -> https://algs4.cs.princeton.edu/home/ After succesfully setting up your environment compile each java file.

To run program: user$ java Editdistance < input.txt