This commit is contained in:
commit
568474d52f
1591 files changed
+528213
No files matched your search
@@ -0,0 +1,12 @@
|
||||
{
|
||||
"tool": "dafny",
|
||||
"version": "4.11.0",
|
||||
"flags": [
|
||||
"verify",
|
||||
"--resource-limit",
|
||||
"20000000"
|
||||
],
|
||||
"source_sha256": "374ce6664efd8802bb90e120a1107375c0ab607c9829987b26d73d5f5fd4b009",
|
||||
"verdict": "verified",
|
||||
"summary": "1 verified, 0 errors"
|
||||
}
|
||||
@@ -0,0 +1,19 @@
|
||||
{
|
||||
"tool": "godbolt",
|
||||
"compiler": "mojo_1_2_0",
|
||||
"mojoVersion": "1.2.0",
|
||||
"source_sha256": "b0a5473abe88ee1d6bee716670978df110ceabab60ef98b9789ec3b7ae16f512",
|
||||
"stdin": "3 A A 1 -1 A G 1 -1 T T 5 -4 end\n",
|
||||
"args": "--target-cpu x86-64-v3 --fp-mode contract=off",
|
||||
"asked": "2026-11-12",
|
||||
"result": {
|
||||
"compiled": true,
|
||||
"buildStderr": "",
|
||||
"executed": true,
|
||||
"exitCode": 0,
|
||||
"stdout": "1\n-1\n5",
|
||||
"stderr": "",
|
||||
"timedOut": false,
|
||||
"asm": null
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,5 @@
|
||||
method MatchScore(a: char, b: char, match_: int, mismatch: int) returns (r: int)
|
||||
ensures (a == b && r == match_) || (a != b && r == mismatch)
|
||||
{
|
||||
if a == b { r := match_; } else { r := mismatch; }
|
||||
}
|
||||
@@ -0,0 +1,4 @@
|
||||
def match_score(a: String, b: String, match_: Int, mismatch: Int) -> Int:
|
||||
if a == b:
|
||||
return match_
|
||||
return mismatch
|
||||
@@ -0,0 +1,2 @@
|
||||
def match_score(a, b, match, mismatch):
|
||||
return match if a == b else mismatch
|
||||
@@ -0,0 +1,44 @@
|
||||
{
|
||||
"name": "MatchScore",
|
||||
"summary": "The score of aligning letter A with letter B: Match when they are the same, Mismatch otherwise.",
|
||||
"tags": [
|
||||
"alignment",
|
||||
"scoring"
|
||||
],
|
||||
"sources": [
|
||||
{
|
||||
"title": "Durbin, Eddy, Krogh and Mitchison, Biological Sequence Analysis (Cambridge, 1998), chapter 2, Pairwise alignment",
|
||||
"url": "https://doi.org/10.1017/CBO9780511790492.003"
|
||||
}
|
||||
],
|
||||
"cases": [
|
||||
{
|
||||
"call": "MatchScore('A', 'A', 1, -1)"
|
||||
},
|
||||
{
|
||||
"call": "MatchScore('A', 'G', 1, -1)"
|
||||
},
|
||||
{
|
||||
"call": "MatchScore('T', 'T', 5, -4)"
|
||||
}
|
||||
],
|
||||
"references": [
|
||||
{
|
||||
"lang": "python",
|
||||
"level": "plain",
|
||||
"file": "ref/python/plain.py",
|
||||
"note": "The same test."
|
||||
},
|
||||
{
|
||||
"lang": "mojo",
|
||||
"level": "plain",
|
||||
"file": "ref/mojo/plain.mojo",
|
||||
"note": "The same test in Mojo; a letter is a String of one character."
|
||||
}
|
||||
],
|
||||
"proof": {
|
||||
"lang": "dafny",
|
||||
"file": "proof/match_score.dfy",
|
||||
"note": "The score is Match exactly when the letters agree."
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,10 @@
|
||||
// MatchScore: the score of aligning letter A with letter B: Match when they
|
||||
// are the same letter, Mismatch otherwise. The simplest substitution score;
|
||||
// a substitution matrix such as BLOSUM62 replaces it for proteins.
|
||||
FUNCTION MatchScore(A : CHAR, B : CHAR, Match : INTEGER, Mismatch : INTEGER) RETURNS INTEGER
|
||||
ENSURE (A == B AND RESULT == Match) OR (A != B AND RESULT == Mismatch)
|
||||
IF A == B THEN
|
||||
RETURN Match
|
||||
ENDIF
|
||||
RETURN Mismatch
|
||||
ENDFUNCTION
|
||||
Reference in new issue
Block a user