Bioinformatics

a="GAGATACCTACGACGGGCGCAGGGACCTGTATTCGAGGCAAGCCAGGCCGCTTTATACCGTCTGCTTCCGCCTCCGGGCCTTCAACTGCATGGTATTAGGTTATGATGCGGAACTAGTTTACTTCGGACGGCCCAGCACTTTGATTATCGTGCCAGATGTAAAGCGATGATCTCCAGGAACCATAAGCAATGAAAATGACCGGATCACCCATTGGCGCCCTGGGTCATCAACAAACCCACAACTCTCCGGTTTGTGACAGACAGTCATGCGGTGGTTCAGATCATCACCACGCGTAGAAATGTAACAGCAGGCAACAGATAATAATAAGTGGCGGGGAATAGTTAATGGGAGAACGTACGGGAACCAGTCCGGAGATATAGTCGTCGCTACCGCAGCTCCCATAGACTCGGTTGGCTTATCTCTAGTGTCCGTCGCCCTTCATGACGTCGGCGTGAAAACCAAGGGTTCAGCTTGTCGGGCGTAGTAAAATTGCCTTACACAGTTGATTCTAAATCCTACCGAAAGTTTGAGGAGAGGAATTGCAATAGGGCGGAGGCCCGGACACACCTCAGGCCAGGTCCATGCACGGCTACATCTCGAAAATCGACGGCACGATCGAGGCGAGAGATGGATATGACCCGTTTTCAGTGCTTTCATCTAGCTATTGGCGCCGCAGAACATTAGCTGGCGTGTACTTCCAGTACGCCCTAATGAACGCACGCTTGTGCTAAGCGGGTCTCTGGAACAGGACCAAGGCAAGCTTTGGGTTGTGTTAGAGCACTTTCAGCACGCGAGCGCAATTGGGACTAGCTGGTAAGAACATTACTAGCGCCAGGATGATCACTACATAAGGCGCATATACACTGTCAGCTCCCCGGGCCTCGCAACGAGGTGCCCTGTGGTTTGAAGGGCAGGACTGCGGGTCCCAAGGCCGTTGTCTGGAAAACCACTTGGCTGG"
a= a.replace("T","U")
print(a)

An RNA string is a string formed from the alphabet containing 'A', 'C', 'G', and 'U'.

Given a DNA string t$t$ corresponding to a coding strand, its transcribed RNA string u$u$ is formed by replacing all occurrences of 'T' in t$t$ with 'U' in u$u$.

Given: A DNA string t$t$ having length at most 1000 nt.

Return: The transcribed RNA string of t$t$.

a="AGGGCCCCACCAGTACGTCTGGCCAGGGGACTGTGTTAGTGGTGTCGACAGCCGCCACAGGCATAACGATGGATATATACTCCGATACGCATCTCGTAGATTGCCCTATAGGCAGTGGGCAATTAGTAGCGCCCAGTTTTCAAGAGACCTCACGCTCTAGCGAAGCTACGTTTGCCCCCGGGGTGTAAGGGGGCTAAGGTCTACCCGGATCGCGAGGTGGAAGGCCTAAGTAGATCGAATGGTATAAAGGACATCGCATAATAACGTGGAGTGGATCCATCGCACATTACCATTCTGATTACAGTTTTTAATGAATCAATGTTCGGGTTGACCGGGACAAAAATACATGCAGACGATGATAACGCAACTAAATTAACCCCGTTGCAACCTGGTCGCTAGATGACTCCTTTTGATACGAATGCCATTAGTAACGTCATCCTGCGCCGAAGGAGTATTTAATGCAATCCGATACTGGTGAGGGTCCAGAAATTCAGCTTCCGATAGAGCACCCGGGTGATCGTCCTACGTTTGTGGATTTGTCGTTGCTGCCGCTTTTAATACGCTTTTCGGAGTATTCAAGAGCCATCGAGGTGTAGGTCCCTTCGATGTCATTTCTATGGACCGAGCGTGGAGGACCACGCGACCGCCAATATTTCCTTTTCCTTAGAGGACACAAGTAGGCTTTAGATGCGACCAACAAGAAGACGAGTGGGTGACCTAGTGCCCATGCCACATCGATGGGGCAAGGCTTTATGATTAATGACCAAGGGGACTGTTGGTGTTGCTACATCGATCAATGTCTGTCTCAATAGCATAGTCGGACGGCGTGTCGTAAGCAAGCTTTATCTATATTGAGAGACGGGCACATAACGGAAAGCACGCCCGTCGTCTGGTCCACCTCTCTTTA"
a= a.translate({ord('A'):'T',ord('T'):'A',ord('G'):'C',ord('C'):'G'})
a= a[::-1]
print(a)

In DNA strings, symbols 'A' and 'T' are complements of each other, as are 'C' and 'G'.

The reverse complement of a DNA string s$s$ is the string sc$s^{\text{c}}$ formed by reversing the symbols of s$s$, then taking the complement of each symbol (e.g., the reverse complement of "GTCA" is "TGAC").

Given: A DNA string s$s$ of length at most 1000 bp.

Return: The reverse complement sc$s^{\text{c}}$ of s$s$.

import re

a ="AAGACACTGATGTAACTCGCAGCGTGAGTGGTGTTGAATGAGCCTATCATGAGTATGGTAGCCACTCATTACCGGATGCGGTTAGACCGACCAAGAAATTCAACTAGATACGTTCGCCTCGGCGCGACGCTTGGTTGCTGGTGGATCGGCTCCAAGTTACCATCGTTAAGCCACGGTGACACCAATCTGTTAAAATGGCTTCGAGCTCCCTACGGTTTCCAATATGACATAGACTAGGAAATGATGACTACCTAGCCGCCCCGTCGTTACTTCGATCCTATAGACTATACGAGGTAACAATCAACGGAGTGATAGAGCCGGGTACAAAAGCGCGTGCTAAAATCCTGACTTGAATCGATTGCACTGCCGGCGGTTGAACTTACCTGGACCAGCCACTAATCCTCTTCCCGTCGGGTCGGTCACGCGTTACGTGCCCTAACCTGCAGTCGCTTTGACATGCGGCACCGAGATAAGGCTCGTATTCAGACCCGCCGGTATGCGAGTACAGCAGGGCAGGGTGACGGTCCCCAAGTGAACGCAACTATCGCCTGCACGCACTGGAGAAAGAGCTCGAACTTATATCACCCGACTTCAAGTTTTTAAATTGATCCACTGTGGTCCGGACCCCCAGGCCGCTTAGAGTGGCGCCTGTTTCCATGACTTTGTACCATCTAGTATACTATCGCGAGAACTGTGCACGGGTTTACTTCCACACATTTGTTGTCGATCCTGATCTCGCTTTTGAATCGCGGCGGCTGGATTCGGGGGCATTGTAATTGACCACAATATACCGACACGACTATCACGCTCGACTAGTAGCTGCGGAGGACTTACTTATAGTCTAATGTAAATTTCTATCAATCAAGGGATACTGTAGAAGTGGTGGACGCCCGATGTACACTAATCACATGGCTAGGAG"

counta=0
countb=0
countc=0
countd=0
for i in range(0,len(a)):
    if a[i]=='A':
        counta+=1
    if a[i]=='T':
        countb+=1
    if a[i]=='G':
        countc+=1
    if a[i]=='C':
        countd+=1

print(counta,countd, countc, countb)

A string is simply an ordered collection of symbols selected from some alphabet and formed into a word; the length of a string is the number of symbols that it contains.

An example of a length 21 DNA string (whose alphabet contains the symbols 'A', 'C', 'G', and 'T') is "ATGCTTCAGAAAGGTCTTACG."

Given: A DNA string s$s$ of length at most 1000 nt.

Return: Four integers (separated by spaces) counting the respective number of times that the symbols 'A', 'C', 'G', and 'T' occur in s$s$.