Baseline: tree as shared
This commit is contained in:
1679 files changed
+1024562
No files matched your search
@@ -0,0 +1,25 @@
|
||||
# Generated by Programming+ from pseudo. Not reviewed for Mojo best practices.
|
||||
|
||||
# The reverse complement of a strand: read backwards, each base swapped for its partner.
|
||||
def reverse_complement(t: String) -> String:
|
||||
# ENSURE LENGTH(RESULT) == LENGTH(T)
|
||||
var answer: String
|
||||
var partner: String
|
||||
answer = ""
|
||||
for i in range(t.count_codepoints() - 1, -1, -1):
|
||||
if String(t[codepoint=i]) == "A":
|
||||
partner = "T"
|
||||
elif String(t[codepoint=i]) == "T":
|
||||
partner = "A"
|
||||
elif String(t[codepoint=i]) == "G":
|
||||
partner = "C"
|
||||
elif String(t[codepoint=i]) == "C":
|
||||
partner = "G"
|
||||
else:
|
||||
partner = "N"
|
||||
answer = answer + partner
|
||||
return answer
|
||||
|
||||
|
||||
def main():
|
||||
print(reverse_complement("GATTACA"))
|
||||
Reference in new issue
Block a user