Routines written once in pseudo and checked at every level, so programs can use them by name instead of rewriting and re-verifying them: - stats: Mean, Variance (two-pass) - numerics: KahanSum, LinearInterp, Trapezoid - align: LinearGapPenalty, AffineGapPenalty, MatchScore, NeedlemanWunschScore - md: LennardJones, LennardJonesForce, MinimumImage, PairDistance - seq: GCContent, HammingDistance - special: ErfApprox (Abramowitz and Stegun 7.1.26) Each has contracts, cases, reference implementations in Python, Mojo and (for the numerical ones) C at more than one level, and nine have a Dafny proof over exact numbers. status.json and STATUS.md are written by pplus-core's library-check: every check passes or is open/unverified as listed there. The Mojo references still need the pinned compiler's answers (library-verify-mojo, network). Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
13 lines
481 B
Python
13 lines
481 B
Python
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]
|