Levenshtein distance/Alignment: Difference between revisions
m
→{{header|Sidef}}: updated code
m (→{{header|Sidef}}: update) |
m (→{{header|Sidef}}: updated code) |
||
Line 492:
var A = []
for i (1 .. s.end
for j (1 .. t.end
if (s[i] != t[j]) {
A[i][j]{:d} = 1+(
var min = Math.min(A[i-1][j]{:d}, A[i][j-1]{:d}, A[i-1][j-1]{:d})
)
A[i][j]{@|<s t>} =
? [A[i-1][j]{:s}+s[i], A[i-1][j]{:t}+'-']
: (A[i][j-1]{:d} == min
? [A[i][j-1]{:s}+'-', A[i][j-1]{:t}+t[j]]
: [A[i-1][j-1]{:s}+s[i], A[i-1][j-1]{:t}+t[j]]))...
}
else {
| |||