Transcription, Translation & Gene Expression
Level 5 — Mastery (cross-domain: biology + math/probability + coding) Time limit: 75 minutes Total marks: 60
Reference genetic code (standard) may be assumed. Where a codon table is needed, use the standard code (AUG = Met = start; UAA, UAG, UGA = stop).
Question 1 — Central dogma, processing & a combinatorial proof (24 marks)
A eukaryotic gene has a primary transcript (pre-mRNA) whose coding-strand template produces a transcript containing 5 exons and 4 introns. The exons have lengths (in nucleotides) 90, 120, 60, 150, 90 and each intron is 500 nt.
(a) State the central dogma in one line and place transcription, RNA processing, and translation on it. (3)
(b) Explain, mechanistically, why the mature mRNA sent to the cytoplasm is far shorter than the pre-mRNA. Name the three processing events and their functions. (6)
(c) The mature mRNA after splicing (all 5 exons retained, no cap/tail counted) has a 5′ UTR of 30 nt and a 3′ UTR of 42 nt contained within the exon sequence. Compute: (i) total exon nucleotides retained; (ii) the number of nucleotides that are actually coding (open reading frame including the stop codon); (iii) the number of amino acids in the finished polypeptide (assume no post-translational cleavage). (6)
(d) Alternative splicing (combinatorial proof). Suppose the cell can independently retain or skip each of the 3 internal exons (exons 2, 3, 4), but the first and last exons are always retained. (i) Derive a general formula for the number of distinct mature mRNA isoforms when internal exons may each be independently included or skipped, and prove it by induction on . (ii) Evaluate for . (9)
Question 2 — Genetic code, degeneracy & information theory (20 marks)
(a) State what "degeneracy of the genetic code" means and give one biological advantage it confers. (3)
(b) Given the mRNA segment (5′→3′): translate it fully, and for each amino acid give the tRNA anticodon (written 5′→3′). Identify start and stop. (6)
(c) There are 64 codons and 20 amino acids plus stop. (i) Compute the information content (in bits) of specifying one codon vs. one amino-acid-level symbol (21 symbols), assuming uniform distribution. (ii) Compute the average number of codons per amino acid (excluding stop codons), and comment on what this ratio implies about redundancy. (6)
(d) Coding task. Write pseudocode (or Python) for a function translate(mrna, table) that reads a string 5′→3′, finds the first AUG, and translates in-frame until a stop codon, returning the amino-acid string. State its time complexity in Big-O of the input length . (5)
Question 3 — Ribosome kinetics & translation elongation (16 marks)
The ribosome has three tRNA sites: A, P, E. During elongation a tRNA moves A → P → E.
(a) Describe the roles of the A, P, and E sites in one cycle of elongation. (4)
(b) A ribosome adds amino acids at a mean rate of 15 residues per second. A polypeptide is 420 amino acids long (after the initiator Met). (i) Estimate the elongation time. (ii) If 8 ribosomes translate the same mRNA simultaneously (a polysome) and load onto the mRNA every 2 seconds, at steady state how many completed proteins are produced per minute? (6)
(c) Amino-acid incorporation is error-prone. If each codon is read correctly with probability and errors are independent, derive the probability that a 420-residue protein is synthesised with zero misincorporations, and evaluate numerically. Comment on why proofreading matters for long proteins. (6)
Answer keyMark scheme & solutions
Question 1
(a) [3] Central dogma: DNA → (transcription) → RNA → (translation) → Protein. (1) Transcription = DNA→RNA (1); RNA processing acts on the RNA before translation; translation = RNA→protein (1).
(b) [6] Pre-mRNA contains introns (non-coding) interspersed with exons. During splicing by the spliceosome, introns are excised and exons ligated (2), removing large stretches (here 4×500 = 2000 nt) → much shorter mRNA (1). The other two processing events: 5′ capping (7-methylguanosine cap — protects from exonucleases, aids ribosome binding/export) (1.5) and 3′ polyadenylation (poly-A tail — stability, export, translation) (1.5).
(c) [6] (i) Retained exons = 90+120+60+150+90 = 510 nt (2). (ii) Coding nt = 510 − 30 (5′UTR) − 42 (3′UTR) = 438 nt (2). (iii) 438/3 = 146 codons; subtract 1 stop codon → 145 amino acids in the polypeptide (2). (The start Met is included in the 146 codons; polypeptide length = 146 − 1 stop = 145 residues.)
(d) [9] (i) Each of the internal exons has 2 independent states (include/skip). By product rule, number of isoforms . (2) Proof by induction: Base : no internal exons ⇒ exactly 1 isoform . ✓ (1) Inductive step: assume internal exons give isoforms. Add one more internal exon; each existing isoform splits into two (new exon included or skipped), giving . ✓ (3) Hence by induction for all . (1) (ii) isoforms. (2)
Question 2
(a) [3] Degeneracy: multiple codons can specify the same amino acid (more than one codon per amino acid) (2). Advantage: buffers point mutations — many single-base changes (esp. 3rd position "wobble") are synonymous, reducing deleterious effects (1).
(b) [6]
- AUG → Met (Start); anticodon 5′-CAU-3′
- GCC → Ala; anticodon 5′-GGC-3′
- UUU → Phe; anticodon 5′-AAA-3′
- GGA → Gly; anticodon 5′-UCC-3′
- UAA → STOP (no tRNA) Peptide: Met-Ala-Phe-Gly (stop). (1 mark each correct codon translation ×4 = 4; anticodons ×2 pooled = 2). Anticodon = reverse complement of codon read 5′→3′.
(c) [6] (i) Codon info bits (1.5). Amino-acid-level (21 symbols) bits (1.5). (ii) 61 sense codons for 20 amino acids ⇒ average codons per amino acid (2). This >1 ratio confirms redundancy/degeneracy — on average ~3 codons encode each amino acid (1).
(d) [5]
def translate(mrna, table):
i = mrna.find("AUG") # locate start
if i == -1: return ""
prot = []
while i + 3 <= len(mrna):
codon = mrna[i:i+3]
aa = table[codon]
if aa == "*": # stop codon
break
prot.append(aa)
i += 3
return "".join(prot)(logic 3, correct start/stop handling 1) Complexity: single pass, O(n) in input length (dict lookup O(1)) (1).
Question 3
(a) [4]
- A (aminoacyl) site: receives incoming aminoacyl-tRNA whose anticodon matches the codon (1.5).
- P (peptidyl) site: holds the tRNA bearing the growing polypeptide; peptide bond forms transferring chain to A-site tRNA (1.5).
- E (exit) site: holds the now-deacylated tRNA before it leaves the ribosome (1).
(b) [6] (i) Time = 420 / 15 = 28 s (2). (ii) At steady state each ribosome finishes and, since loading interval = 2 s, one protein completes every 2 s once the pipeline is full. Rate = 60/2 = 30 proteins per minute (3). (The 8 ribosomes fill the pipeline; steady-state throughput is set by the loading interval, 1 per 2 s.) (1)
(c) [6] Independent codons ⇒ probability all 420 correct: (2) ; (~88.2%). (2) Comment: error probability per protein ; for longer proteins falls, so proofreading (kinetic + aminoacyl-tRNA synthetase editing) is essential to keep functional protein yield high. (2)
[
{"claim":"Retained exon nt = 510, coding = 438, amino acids = 145",
"code":"exons=90+120+60+150+90; coding=exons-30-42; aa=coding//3-1; result=(exons==510 and coding==438 and aa==145)"},
{"claim":"Alternative splicing isoforms for k=3 is 8",
"code":"k=3; result=(2**k==8)"},
{"claim":"Average codons per amino acid = 61/20 = 3.05",
"code":"result=(Rational(61,20)==Rational(305,100))"},
{"claim":"Zero-error probability 0.9997^420 approx 0.8816",
"code":"P=Float('0.9997')**420; result=(abs(P-Float('0.8816'))<Float('0.001'))"},
{"claim":"Polysome throughput 30 proteins/min at 2s loading interval",
"code":"result=(60/2==30)"}
]