Longest Common Subsequence

edit distance problem

To maximize the number of such matches, we must prevent substitution of nonidentical characters

int match(char c, char d)
{
  if (c == d) return(0);
  else return(MAXLEN);
}
Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License