11 lines
406 B
Python
11 lines
406 B
Python
def needleman_wunsch_score(s, t, match, mismatch, gap):
|
|
m = len(t)
|
|
prev = [j * gap for j in range(m + 1)]
|
|
for i in range(1, len(s) + 1):
|
|
cur = [i * gap] + [0] * m
|
|
for j in range(1, m + 1):
|
|
diagonal = prev[j - 1] + (match if s[i - 1] == t[j - 1] else mismatch)
|
|
cur[j] = max(diagonal, prev[j] + gap, cur[j - 1] + gap)
|
|
prev = cur
|
|
return prev[m]
|