TADM2E 8.1 - Revision history

Matt: Undo revision 813 by Hdyldhdlgzos (talk)

2020-07-23T15:57:13Z

Undo revision 813 by Hdyldhdlgzos (talk)

Hdyldhdlgzos: Blanked the page

2020-07-16T06:30:47Z

Blanked the page

Smarth at 06:50, 10 July 2018

2018-07-10T06:50:47Z

Joky at 08:29, 11 January 2017

2017-01-11T08:29:18Z

Joky: Created page with "This is the regular editing dynamic programming, except that the diagonal as an extra possibility with cost = -1 when a swap is possible. M[I, j] = M[I-1, j-1] if A[I] == B[j..."

2017-01-11T08:29:05Z

Created page with "This is the regular editing dynamic programming, except that the diagonal as an extra possibility with cost = -1 when a swap is possible. M[I, j] = M[I-1, j-1] if A[I] == B[j..."

New page

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

M[I, j] = M[I-1, j-1] if A[I] == B[j-1] and A[I-1] == B[j]

← Older revision	Revision as of 15:57, 23 July 2020
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

← Older revision		Revision as of 06:30, 16 July 2020
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~~

← Older revision		Revision as of 06:50, 10 July 2018
Line 1:		Line 1:
−	This is the regular editing dynamic programming, except that the diagonal as an extra possibility ~~with cost = -1~~ when a swap is possible.	+	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-1, j-1] - 1 ; if A[I] == B[j-1] and A[I-1] == B[j]	+	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

← Older revision		Revision as of 08:29, 11 January 2017
Line 1:		Line 1:
	This is the regular editing dynamic programming, except that the diagonal as an extra possibility with cost = -1 when a swap is possible.		This is the regular editing dynamic programming, except that the diagonal as an extra possibility with cost = -1 when a swap is possible.

−	M[I, j] = M[I-1, j-1] if A[I] == B[j-1] and A[I-1] == B[j]	+	M[I, j] = M[I-1, j-1] - 1 ; if A[I] == B[j-1] and A[I-1] == B[j]