Difference between revisions of "TADM2E 8.1"

From Algorithm Wiki
Jump to: navigation, search
(Blanked the page)
(Undo revision 813 by Hdyldhdlgzos (talk))
 
Line 1: Line 1:
 +
This is the regular editing dynamic programming, except that the diagonal as an extra possibility  when a swap is possible.
  
 +
M[i, j] = M[i-2, j-2] + 1 ; if A[i] == B[j-1] and A[i-1] == B[j]  where i,j > 1

Latest revision as of 15:57, 23 July 2020

This is the regular editing dynamic programming, except that the diagonal as an extra possibility when a swap is possible.

M[i, j] = M[i-2, j-2] + 1 ; if A[i] == B[j-1] and A[i-1] == B[j] where i,j > 1