63
правки
Изменения
Нет описания правки
<tex>D(i, j) = \left\{\begin{array}{lllc}
\min{(A, D(i - 2, j - 2) + transposeCost)}&&;i > 1,\ j > 1,\ S[i] = T[j-1],\ S[i-1] = T[j]\\
A&&;\text{otherwise}\\
\end{array}\right.
d[i, j] = minimum(
d[i-1, j ] + deleteCost, ''<font color=green>// удаление</font>'' d[i , j-1] + insertCost, ''<font color=green>// вставка</font>'' d[i-1, j-1] + replaceCost ''<font color=green>// замена</font>''
)
'''if'''(i > 1 '''and''' j > 1
'''and''' S[i] == T[j-1] '''and''' S[i-1] == T[j]) '''then'''
d[i, j] = minimum(
d[i, j],
d[i-2, j-2] + transposeCost ''<font color=green>// транспозиция</font>''
)
