def needleman_wunsch_score(s, t, match, mismatch, gap): n, m = len(s), len(t) d = [[0] * (m + 1) for _ in range(n + 1)] for i in range(n + 1): d[i][0] = i * gap for j in range(1, m + 1): d[0][j] = j * gap for i in range(1, n + 1): for j in range(1, m + 1): diagonal = d[i - 1][j - 1] + (match if s[i - 1] == t[j - 1] else mismatch) d[i][j] = max(diagonal, d[i - 1][j] + gap, d[i][j - 1] + gap) return d[n][m]