48 lines
1.2 KiB
JSON
48 lines
1.2 KiB
JSON
{
|
|
"name": "GCContent",
|
|
"summary": "The fraction of the letters of a sequence that are G or C.",
|
|
"tags": [
|
|
"sequences",
|
|
"counting"
|
|
],
|
|
"sources": [
|
|
{
|
|
"title": "Biopython, Bio.SeqUtils.gc_fraction: the G+C fraction of a sequence. Biopython also counts S and lowercase letters and, by default, leaves ambiguous letters out of the length; this routine counts only G and C and every letter in the length",
|
|
"url": "https://biopython.org/docs/latest/api/Bio.SeqUtils.html#Bio.SeqUtils.gc_fraction"
|
|
}
|
|
],
|
|
"cases": [
|
|
{
|
|
"call": "GCContent(\"GATTACA\")"
|
|
},
|
|
{
|
|
"call": "GCContent(\"GGCC\")"
|
|
},
|
|
{
|
|
"call": "GCContent(\"ATAT\")"
|
|
},
|
|
{
|
|
"call": "GCContent(\"GCNa\")"
|
|
}
|
|
],
|
|
"references": [
|
|
{
|
|
"lang": "python",
|
|
"level": "plain",
|
|
"file": "ref/python/plain.py",
|
|
"note": "The same count."
|
|
},
|
|
{
|
|
"lang": "mojo",
|
|
"level": "plain",
|
|
"file": "ref/mojo/plain.mojo",
|
|
"note": "The same count in Mojo."
|
|
}
|
|
],
|
|
"proof": {
|
|
"lang": "dafny",
|
|
"file": "proof/gc_content.dfy",
|
|
"note": "The count never exceeds the length, so the fraction lies in [0, 1]."
|
|
}
|
|
}
|