Files
pplus-library/modules/align/needleman-wunsch-score/ref/mojo/plain.mojo
T
alexmandClaude df12b2a008 Start pplus-library: 16 verified routines in six modules
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
2026-10-05 11:58:22 +00:00

26 lines
895 B
Mojo

def needleman_wunsch_score(s: String, t: String, match_: Int, mismatch: Int, gap: Int) -> Int:
var n = s.count_codepoints()
var m = t.count_codepoints()
var d = List[List[Int]]()
for i in range(n + 1):
var row = List[Int]()
for j in range(m + 1):
row.append(0)
d.append(row^)
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):
var score = mismatch
if String(s[codepoint=i - 1]) == String(t[codepoint=j - 1]):
score = match_
var best = d[i - 1][j - 1] + score
if d[i - 1][j] + gap > best:
best = d[i - 1][j] + gap
if d[i][j - 1] + gap > best:
best = d[i][j - 1] + gap
d[i][j] = best
return d[n][m]