49 lines
1.4 KiB
JSON
49 lines
1.4 KiB
JSON
{
|
|
"name": "NeedlemanWunschScore",
|
|
"summary": "The best score of a global alignment of two sequences with a linear gap model, by dynamic programming.",
|
|
"tags": [
|
|
"alignment",
|
|
"dynamic programming"
|
|
],
|
|
"sources": [
|
|
{
|
|
"title": "Needleman and Wunsch, A general method applicable to the search for similarities in the amino acid sequence of two proteins, J. Mol. Biol. 48 (1970)",
|
|
"url": "https://doi.org/10.1016/0022-2836(70)90057-4"
|
|
}
|
|
],
|
|
"cases": [
|
|
{
|
|
"call": "NeedlemanWunschScore(\"GATTACA\", \"GCATGCU\", 1, -1, -1)"
|
|
},
|
|
{
|
|
"call": "NeedlemanWunschScore(\"ACGT\", \"ACGT\", 1, -1, -2)"
|
|
},
|
|
{
|
|
"call": "NeedlemanWunschScore(\"\", \"ACG\", 1, -1, -2)"
|
|
},
|
|
{
|
|
"call": "NeedlemanWunschScore(\"AAAA\", \"TTTT\", 2, -3, -1)"
|
|
}
|
|
],
|
|
"references": [
|
|
{
|
|
"lang": "python",
|
|
"level": "plain",
|
|
"file": "ref/python/plain.py",
|
|
"note": "The same table, filled row by row."
|
|
},
|
|
{
|
|
"lang": "python",
|
|
"level": "two-rows",
|
|
"file": "ref/python/two-rows.py",
|
|
"note": "Only the previous row is kept: memory grows with the length of T alone, the first step toward Hirschberg's linear-space alignment."
|
|
},
|
|
{
|
|
"lang": "mojo",
|
|
"level": "plain",
|
|
"file": "ref/mojo/plain.mojo",
|
|
"note": "The same table in Mojo, as a list of rows."
|
|
}
|
|
]
|
|
}
|