Files
pplus-library/modules/align/linear-gap/routine.json
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

44 lines
959 B
JSON

{
"name": "LinearGapPenalty",
"summary": "The score of a gap of Length positions when every position of a gap scores Gap.",
"tags": [
"alignment",
"gap model"
],
"sources": [
{
"title": "Durbin, Eddy, Krogh and Mitchison, Biological Sequence Analysis, section 2.2"
}
],
"cases": [
{
"call": "LinearGapPenalty(3, -2)"
},
{
"call": "LinearGapPenalty(0, -2)"
},
{
"call": "LinearGapPenalty(10, -1)"
}
],
"references": [
{
"lang": "python",
"level": "plain",
"file": "ref/python/plain.py",
"note": "The same product."
},
{
"lang": "mojo",
"level": "plain",
"file": "ref/mojo/plain.mojo",
"note": "The same product in Mojo."
}
],
"proof": {
"lang": "dafny",
"file": "proof/linear_gap.dfy",
"note": "The product equals the score built position by position: each of the Length positions adds Gap."
}
}