- Give an algorithm to find the longest common subsequence for two given strings using edit distance (the minimal number of additions, deletions and substitutions needed to transform one string into the other).
Created
July 16, 2014 15:19
-
-
Save wetmore/6ab9a2d5949defc07a11 to your computer and use it in GitHub Desktop.
Fun CS problems
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment