in python please see the requirement clear answer. you can copy the table......

# Triples and their three-letter abbreviations

#

'TTT': 'Phe', 'TCT': 'Ser', 'TGT': 'Cys', 'TAT': 'Tyr',

'TTC': 'Phe', 'TCC': 'Ser', 'TGC': 'Cys', 'TAC': 'Tyr',

'TTG': 'Leu', 'TCG': 'Ser','TGG': 'Trp', 'TAG': '***',

'TTA': 'Leu', 'TCA': 'Ser', 'TGA': '***','TAA': '***',

'CTT': 'Leu', 'CCT': 'Pro', 'CGT': 'Arg', 'CAT': 'His',

'CTC': 'Leu', 'CCC': 'Pro', 'CGC': 'Arg', 'CAC': 'His',

'CTG': 'Leu', 'CCG': 'Pro', 'CGG': 'Arg', 'CAG': 'Gln',

'CTA': 'Leu', 'CCA': 'Pro', 'CGA': 'Arg', 'CAA': 'Gln',

'GTT': 'Val', 'GCT': 'Ala', 'GGT': 'Gly', 'GAT': 'Asp',

'GTC': 'Val','GCC': 'Ala', 'GGC': 'Gly', 'GAC': 'Asp',

'GTG': 'Val', 'GCG': 'Ala','GGG': 'Gly', 'GAG': 'Glu',

'GTA': 'Val', 'GCA': 'Ala', 'GGA': 'Gly','GAA': 'Glu',

'ATT': 'Ile', 'ACT': 'Thr', 'AGT': 'Ser', 'AAT': 'Asn',

'ATC': 'Ile', 'ACC': 'Thr', 'AGC': 'Ser', 'AAC': 'Asn',

'ATG': 'Met', 'ACG': 'Thr', 'AGG': 'Arg', 'AAG': 'Lys',

'ATA': 'Ile', 'ACA': 'Thr', 'AGA': 'Arg', 'AAA': '

9:41 Sl 90% Background DNA is made up of sequences of nucleotides. There are four nucleotides: Adenine, Cytosine, Guanine, and Thymine, represented by the letters A, C, G, and T. Every set of three nucleotides produces one of twenty amino acids. For example, Cytosine, Thymine, and Guanine (CTG) produce Leucine. Note that there are 64 combinations of three nucleotides, and only twenty amino acids, so that means that a single amino acid can be produced in many different ways. The following tables, taken from the Biolnformatics tutoriale are Copyright 1999 by Boris Steipe, University of Munich. The table at the left shows the names of the amino acids and their abbreviations. The table at the right shows the abbreviations of the amino acids and the nucleotide sequences which produce them. "T" "C" "G" "A" TTT:Phe TCT:Ser TGT:Cys TAT:Tyr TTC:Phe TCC:Ser TGC:Cys TAC:Tyr TTG:Leu TCG:Ser TGG:Trp TAG *** TTA:Leu | TCA-Ser | TGA:"" | TAA:* CTT:Leu CCT:Pro CGT:Arg CAT:His CTC:Leu |CCC:Pro CGC:Arg/CAC:His CTG:Leu CCG:Pro CGG:Arg CAG:Gin 9:41 PM QS90% 1 GTT:Val GCT:Ala GGT:Gly GAT:Asp GTC:Val GCC:Ala GGC:Gly GCC-Ala GGC Gly GAC:Asp GTG:Val GCG:Ala GGG:Gly GAG:Glu GTA:Val GCA:Ala GGA:Gly GAA:Glu ATT:lle ACT:Thr AGT:Ser AAT:Asn ATC:lle ACC:Thr AGC:Ser AAC:Asn ATG:Met ACG:Thr AGG:Arg AAG:Lys ATA:lle ACA:Thr AGA:Arg AAA:Lys You will write a program that repeatedly accepts as input a string of ACGT triples and produces a list of the triples and the corresponding amino acids, one set per line. The program will continue to accept input until the user just presses ENTER without entering any DNA codes. Here is a sample run of the program. Note that some sequences, such as TAG, do not produce an amino acid. They are listed as *** for their three- letter abbreviation. Do not presume that there will never be more than 4 sequences. Somebody could enter a string with 40 three-letter sequences, or 50, or 80, and your program would have to process that string correctly. Enter a nucleotide sequence, or just press EN TER to quit: aaacgatcaccc AAA Lys CGA Arg TCA Ser ce Dre 9:41 PM OS: 90% Enter a nucleotide sequence, or just press EN TER to quit: cgi tat tca CGI invalid sequence TAT Tyr TCA Ser Enter a nucleotide sequence, or just press EN TER to quit: tag cat agg ctt TAG *** CAT His AGG Arg CTT Leu Enter a nucleotide sequence, or just press EN TER to quit: tca cag gtt og Error: You must give complete triples. Enter a nucleotide sequence, or just press EN TER to quit: Breaking a String into Triples This takes a bit of doing. I suggest you do this: Write a function named clean_sequence() takes a string as its single parameter. It will use a for loop to go through the string one character at a time, if the letter is alphabetic, convert it to upper case and add it on to the end of a result string. The function returns the result string. For example, clean_sequence('aaa, TCG, gaa' will return "AAATCGGAA Use a while loop that goes through the cleaned sequence one triple at a time and processes it. Program Requirements