http://codepad.org/QSaNaQlH
On Mon, Jul 19, 2010 at 10:29 PM, Anand <anandut2...@gmail.com> wrote: > Given two text strings A of length n and B of length m, you want to > transform A into B with a minimum number of operations of the following > types: delete a character from A, insert a character into A, or change some > character in A into a new character. The minimal number of such operations > required to transform A into B is called the edit distance between A and B. > > Solution: > > ci = Insertion cost > cd= deletion cost > cr=replacement cost. > > T[i][j] = Min cost to transform A[1..i] to B[1...j] > http://codepad.org/y1oUtioX > > Is there any better solution available? > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
