On the optimality of the standard genetic code: the role of stop codons

Similar documents
1. In most cases, genes code for and it is that

Translation. A ribosome, mrna, and trna.

Organic Chemistry Option II: Chemical Biology

(Lys), resulting in translation of a polypeptide without the Lys amino acid. resulting in translation of a polypeptide without the Lys amino acid.

Lecture 5. How DNA governs protein synthesis. Primary goal: How does sequence of A,G,T, and C specify the sequence of amino acids in a protein?

From Gene to Protein

Packing of Secondary Structures

Multiple Choice Review- Eukaryotic Gene Expression

UNIT 5. Protein Synthesis 11/22/16

SEQUENCE ALIGNMENT BACKGROUND: BIOINFORMATICS. Prokaryotes and Eukaryotes. DNA and RNA

Lecture Notes: BIOL2007 Molecular Evolution

Lecture 15: Realities of Genome Assembly Protein Sequencing

MATHEMATICAL MODELS - Vol. III - Mathematical Modeling and the Human Genome - Hilary S. Booth MATHEMATICAL MODELING AND THE HUMAN GENOME

Chapter 17. From Gene to Protein. Biology Kevin Dees

Videos. Bozeman, transcription and translation: Crashcourse: Transcription and Translation -

Investigation Of The Relationship Between The Hydrophobicity Of An Amino Acid And Codon, Which Shall Encodes

Molecular Biology - Translation of RNA to make Protein *

A colorful origin for the genetic code

Codon Distribution in Error-Detecting Circular Codes

From DNA to protein, i.e. the central dogma

GENETICS - CLUTCH CH.11 TRANSLATION.

Translation Part 2 of Protein Synthesis

Genetic code: Lucky chance or fundamental law of nature?

Energy and Cellular Metabolism

Translation. Genetic code

From gene to protein. Premedical biology

Single alignment: Substitution Matrix. 16 march 2017

Data Mining in Bioinformatics HMM

Introduction to the Ribosome Overview of protein synthesis on the ribosome Prof. Anders Liljas

Bio 1B Lecture Outline (please print and bring along) Fall, 2007

No Not Include a Header Combinatorics, Homology and Symmetry of codons. Vladimir Komarov

Computational Biology: Basics & Interesting Problems

Sequence analysis and comparison

Crick s early Hypothesis Revisited

arxiv:q-bio/ v1 [q-bio.pe] 19 Oct 2004

Lecture 18 June 2 nd, Gene Expression Regulation Mutations

A different perspective. Genes, bioinformatics and dynamics. Metaphysics of science. The gene. Peter R Wills

In this article, we investigate the possible existence of errordetection/correction

P systems based on tag operations

TREND OF AMINO ACID COMPOSITION OF PROTEINS OF DIFFERENT TAXA

RNA & PROTEIN SYNTHESIS. Making Proteins Using Directions From DNA

Translation and the Genetic Code

Name Block Date Final Exam Study Guide

Genetic Code, Attributive Mappings and Stochastic Matrices

Supplemental Materials

Advanced Topics in RNA and DNA. DNA Microarrays Aptamers

TRANSLATION: How to make proteins?

Gene Expression: Translation. transmission of information from mrna to proteins Chapter 5 slide 1

Secondary Structure. Bioch/BIMS 503 Lecture 2. Structure and Function of Proteins. Further Reading. Φ, Ψ angles alone determine protein structure

Massachusetts Institute of Technology Computational Evolutionary Biology, Fall, 2005 Notes for November 7: Molecular evolution

Bustamante et al., Supplementary Nature Manuscript # 1 out of 9 Information #

Local Alignment Statistics

Phylogeny and systematics. Why are these disciplines important in evolutionary biology and how are they related to each other?

A GA Mechanism for Optimizing the Design of attribute-double-sampling-plan

Evolutionary Analysis of Viral Genomes

PROTEIN SYNTHESIS INTRO

POPULATION GENETICS Winter 2005 Lecture 17 Molecular phylogenetics

arxiv:q-bio/ v3 [q-bio.pe] 2 Feb 2005

WHERE DOES THE VARIATION COME FROM IN THE FIRST PLACE?

O 3 O 4 O 5. q 3. q 4. Transition

Microbial Taxonomy and the Evolution of Diversity

GENETIC CODE AS A HARMONIC SYSTEM: TWO SUPPLEMENTS. Miloje M. Rakočević

Energy Minimization of Protein Tertiary Structure by Parallel Simulated Annealing using Genetic Crossover

A complementation test would be done by crossing the haploid strains and scoring the phenotype in the diploids.

Dobbiaco Lectures 2010 (1)Solved and Unsolved Problems in

Diego L. Gonzalez. Dipartimento di Statistica Università di Bologna. CNR-IMM Istituto per la Microelettronica e i Microsistemi

Newly made RNA is called primary transcript and is modified in three ways before leaving the nucleus:

Marshall Nirenberg and the discovery of the Genetic Code

Flow of Genetic Information

The Journal of Animal & Plant Sciences, 28(5): 2018, Page: Sadia et al., ISSN:

Prof. Christian MICHEL

Protein Synthesis. Unit 6 Goal: Students will be able to describe the processes of transcription and translation.

Cell biology traditionally identifies proteins based on their individual actions as catalysts, signaling

Section 7. Junaid Malek, M.D.

Genetic Algorithms: Basic Principles and Applications

Full file at CHAPTER 2 Genetics

Tools and Algorithms in Bioinformatics

Targeting Polypeptides to Specific Locations

DNA THE CODE OF LIFE 05 JULY 2014

Practice Problems 6. a) Why is there such a big difference between the length of the HMG CoA gene found on chromosome 5 and the length of the mrna?

Early History up to Schedule. Proteins DNA & RNA Schwann and Schleiden Cell Theory Charles Darwin publishes Origin of Species

Ribosome readthrough

Evaluation of the Number of Different Genomes on Medium and Identification of Known Genomes Using Composition Spectra Approach.

1. Contains the sugar ribose instead of deoxyribose. 2. Single-stranded instead of double stranded. 3. Contains uracil in place of thymine.

Drosophila melanogaster and D. simulans, two fruit fly species that are nearly

2. What was the Avery-MacLeod-McCarty experiment and why was it significant? 3. What was the Hershey-Chase experiment and why was it significant?

Translation - Prokaryotes

Sequence Database Search Techniques I: Blast and PatternHunter tools

Polymorphism due to multiple amino acid substitutions at a codon site within

Organization of Genes Differs in Prokaryotic and Eukaryotic DNA Chapter 10 p

Translation and Operons

Reading Assignments. A. Genes and the Synthesis of Polypeptides. Lecture Series 7 From DNA to Protein: Genotype to Phenotype

SUPPLEMENTARY INFORMATION

Algorithms in Bioinformatics FOUR Pairwise Sequence Alignment. Pairwise Sequence Alignment. Convention: DNA Sequences 5. Sequence Alignment

ON THE COMPLETENESS OF GENETIC CODE: PART V. Miloje M. Rakočević

Advanced topics in bioinformatics

Sequence Alignment: A General Overview. COMP Fall 2010 Luay Nakhleh, Rice University

The human globin as a model to study quality control of gene expression in the nucleus. Noélia Custódio

Computational Cell Biology Lecture 4

The translation machinery of the cell works with triples of types of RNA bases. Any triple of RNA bases is known as a codon. The set of codons is

Transcription:

On the optimality of the standard genetic code: the role of stop codons Sergey Naumenko 1*, Andrew Podlazov 1, Mikhail Burtsev 1,2, George Malinetsky 1 1 Department of Non-linear Dynamics, Keldysh Institute for Applied Mathematics of RAS, Moscow 125047, Russia. 2 Department of Systemogenesis, Anokhin Institute of Normal Physiology of RAMS, Moscow 125009, Russia. Corresponding author: Sergey Naumenko Address for Correspondence: Russian Academy of Sciences, Keldysh Institute for Applied Mathematics, Department of Non-linear Dynamics, Miusskaya Place 4, RU-125047, Moscow, Russia E-mail:sergey_clark@yahoo.co.uk Tel.: +7 (495) 2507802 Fax: +7 (495) 9720737 1

Abstract The genetic code markup is the assignment of stop codons. The standard genetic code markup ensures the maximum possible stability of genetic information with respect to two fault classes: frameshift and nonsense mutations. There are only 528 (about 1,3% of total number) optimal markups in the set of markups having 3 stop codons. Among the sets of markups with 1,2 8 stop codons, the standard case having 3 stop codons has maximum absolute number of optimal markups. Keywords Genetic code; Optimality; Stop codons assignment Introduction The standard genetic code is shared by all living organisms with a few insignificant exceptions. Formally, the genetic code is a mapping of an alphabet consisting of 64 codons onto a set consisting of 20 letters (amino-acids) and one punctuation mark. Amino acids are coded in genome by triplets of nucleotides. The position of a nucleotide in a triplet is significant. Therefore, there are 4 3 =64 different codons. There are 61 triplets among the codons, which encode amino acids and 3 stop codons which terminate the protein synthesis process. The choice of 3 stop codons constitutes the genetic code markup. The standard genetic code is one of many possibilities (Trainor, 2001). Even before the complete decryption of the genetic code there was a question: why amino-acids are coded just this way (Woese, 1965). For a long time the natural genetic code was thought to be a «frozen accident» (Crick, 1968). But many statistical studies support the theory that this genetic code has evolved towards minimizing errors of transcription and translation (Goodarzi et al., 2004). In particular, it has been proved that natural genetic code minimizes the effect of point mutations or mistranslations: either the erroneous codon is a synonym of the original amino acid, or it encodes an amino acid with 2

similar chemical properties (Freeland, Hurst, 1998). Apart from this fact the natural genetic code possesses a set of symmetries and a semantic structure (Gusev,Shulze-Makuch, 2004). The main goal of our work is to find out why the genetic code uses TAA, TAG and TGA codons as punctuation marks. A choice of stop codons affects error protection of encoded information in case of frameshift and point mutations. Frameshift mutations. A codon is entirely defined by the starting position of triplet reading or the reading frame. Therefore there are 3 different ways to read the same nucleic sequence depending on reading frame shift (Fig. 1). Below we shall call the gene reading with left shift by 1 nucleotide as shift 1, and the reading with right shift by 1 nucleotide as shift 2 (Fig. 2). If a pair of consecutive sense codons gives stop codon in process of reading with a shift, we call it a terminating pair. Optimization task 1 consists in minimization of the influence of frameshift mutations due to maximizing the number of terminating pairs of sense codons. Point mutations. Point mutation in a sense codon may result in appearance of sense codon or stop codon (Fig. 3.), i.e. the markup affects the probability of nonsense mutations. Point mutations leading to the transformation of a sense codon into a stop one are named nonsense mutations. We name codons for which nonsense mutation is possible as vulnerable codons. The total number of nonsense mutations (over the entire code) is equal or greater than a number of vulnerable codons because a vulnerable codon may be subjected to several different nonsense mutations. Optimization task 2-a consists in minimization of the number of vulnerable codons. Optimization task 2-b consists in minimization of the number of nonsense mutations. 3

We assume that the genetic code has a protection mechanism on the level of its markup, i.e. on the level of stop codons choice, contrary to the biochemical level. The first group of questions we address is related to optimization task 1: 1) How does the choice of stop codons affect blocking of frameshift mutations? 2) What values can possess the number of terminating pairs of sense codons? 3) How is the set of genetic code markups with 3 stop codons distributed according to the possible values of the number of terminating pairs of sense codons? 4) How optimal is the canonical markup from the point of view of optimization task 1? The second group of questions is related to optimization task 2: 1) How does the choice of stop codons affect blocking of point mutations? 2) What values can possess the number of vulnerable codons and the number of nonsense mutations? 3) How is the set of genetic code markups with 3 stop codons distributed according to the possible values of the number of vulnerable codons and the number of nonsense mutations? 4) How optimal is the canonical markup from the point of view of optimization task 2? Is the canonical markup optimal for task 2-a or for task 2-b? All these questions are related to markups with 3 stop codons. Finally, it is interesting, how many optimal markups exist in sets with various numbers of stop codons? Methods Crick et al. considered a set of codes involving nonoverlapping triplets of nucleotides. Each triplet codes one amino acid. All codes have no stop codons. Crick et al. showed that to avoid frameshift mutations, we must limit the number of different kinds of amino acids that the code can handle. They proved that the upper bound equals 20 and showed that a code for 20 amino acids 4

exists (Crick et al, 1957). It is well known that the experimentally found number equals 20 and this research is an example of the power of simple genetic code models. In a number of statistical studies (see review in Goodarzi et al., 2004) the canonical genetic code is compared with randomly generated codes in order to assess relative efficiency of the natural code with the various types of fitness functions. Our approach is closer to the former (Crick et al.,1957) one rather than the latter. At first we consider only markups with 3 stop codons. There are 3 64! 64 63 62 C 64 = = = 41664 such markups. For every markup from this set we calculate the 61!3! 1 2 3 following values: 1) the number of terminating pairs of codons in the case of shift 1; 2) the number of terminating pairs of codons in the case of shift 2; 3) the number of vulnerable codons; 4) the number of missense mutations. We work with characteristics 1-2 and 3-4 separately. For example, there are markups with the same characteristics 1. We group markups with the same values of the number of terminating pairs of codons in the case of shift 1 and calculate their number. After the detailed study of the set of markups containing 3 stop codons, we apply the same algorithm to the sets with 1,2, 8 stop codons. Results The choice of stop codons affects the number of terminating pairs of sense codons. The bigger is the number of terminating pairs in a genetic code markup, the better it blocks the frameshift mutations. Let us consider different genetic code markups with 3 stop codons, and for each code calculate the maximum possible number of terminating pairs of codons for both types of shift (left 5

or right). There are 61 61=3721 pairs of sense codons. They form sequences of 6 characters belonging to the {A;G;C;T} alphabet. Neither the first nor the second part of such sequence (the first part consists of characters 1-2-3, the second one consists of characters 4-5-6) is a stop codon. The pair of sense codons is terminating one if it contains 3 sequential nucleotides forming a stop codon in the positions 2 3 4 or 3 4 5 (Fig.2.). The maximum possible number of terminating pairs of codons for each type of shift equals 192=3 4 4 4 (3 variants of stop-codon 4 4 4 variants of another nucleotides). This maximum is reached in shift 1 and shift 2 simultaneously. Indeed, necessary and sufficient condition for the markup s optimality in opmization task 1 is the absence of stop codons coinciding first and last nucleotides (different codons, for example TAG and GCT or TAG and AGC, or single codon, for example CCC or GTG). The calculation shows, that the canonical markup has the maximum possible number of terminating pairs for both frame shifts. There are 2432 markups (this is 5,8% of total number of markups (41664)) with 192 terminating pairs for both frame shifts. The distribution of markups vs the number of terminating pairs of codons for the shift 1 (for the shift 2 the distribution is the same) is shown in Fig.4. A choice of stop codons affects the number of nonsense mutations and vulnerable codons. There are 27 possible point mutations leading to one of the 3 stop codons (3 stop-codons 3 triplet positions 3 nucleotide types). Every point mutation, which transforms a stop codon into another stop codon, decreases the number of nonsense mutations. The maximum number of mutations transforming a stop codon into another one equals 6. All possible markups fall into 10 classes according to the number of vulnerable codons and to the number of nonsense mutations. It is possible to combine these 10 classes into 4 groups (a-d) according to the number of nonsense mutations for each class (see Table 1). 6

In the group (a) one stop codon can be transformed to any of two others, but those cannot be transformed to each other by point mutation. The standard genetic code belongs to this group (standard stop codons: TAA, TAG, TGA). Here the total number of point mutations transforming stop codon to stop codon equals 4. Consequently, for the sense part of code there are 27 4 = 23 nonsense mutations. In this case, 5 sense codons can be transformed to one of two stop codons and 23-5 2 = 13 sense codons can be transformed to only one stop codon. Hence, there are 5+13 = 18 vulnerable codons in total. This is the minimum possible value of vulnerable codons among all 10 classes. It is interesting that the standard genetic code markup has the minimum number of vulnerable codons rather than the minimum number of nonsense mutations. In the group (b) for every stop codon there are 2 point mutations transforming it to another stop codon. There are 6 such mutations. In this group only one of sense codons can be transformed to any of 3 stop codons and 6 sense codons can be transformed to one of 3 stop codons. Hence, there are 1+6+6+6 = 19 vulnerable codons and 1 3+6+6+6 = 21 possible nonsense mutations. In the group (c) there are only two possible point mutations transforming a stop codon to a stop codon. Only one stop codon mutates to only one of others two and vice versa. Hence, there are 25 nonsense mutations and 20 or 21 or 23 vulnerable codons in this group. In the group (d) none of stop-codons can be transformed to another one. All of 27 nonsense mutations belong to the sense part of the code. A number of vulnerable codons may be equal 21, 22, 23, 25, 27. We found that there are 2432 markups with the minimum possible number of sense codons which can be transformed to stop codon by point mutation, and only 528 of them (about 1,3% of the total number of markups) have the maximum number of terminating pairs. The canonical markup belongs to this small set. 7

If one assumes that the genetic code markup evolves, then not only stop codons assignments should be varied but the number of stop codons itself should be changed too. We considered the sets of markups with 1,2, 8 stop codons and calculated numbers of optimal markups (with highest numbers of terminating pairs and lowest numbers of vulnerable codons). Figure 5 summarizes our calculations. The case with 3 stop codons (528 optimal markups) is the local and the global maximum. (See also Table 2). Thus we proved that the choice of stop codons TAA, TAG and TGA in the standard genetic code ensures the protection of information encoded with respect to the frameshift and nonsense mutations. Detailed results published in (Naumenko, Podlazov, 2005). Discussion Having these results we can hypothesize that the following factors affect the evolution of the genetic code markup. (i) The shift of the reading frame is a non-local error which leads to completely different sequence of codons. Therefore the corresponding sequence of amino-acids would also be changed completely. This unexpected new protein would have totally different properties and function. It completely distorts the meaning of the gene. In this case not only the cell resources are spent on synthesizing of nonfunctional protein, but the resulting amino acid sequence may be harmful. The best way to handle this problem is to stop the mutant gene expression as soon as possible. Therefore, the genetic code markups with higher number of terminating pairs protect a cell better against possible damage caused by frameshift mutation. (ii) An accidental substitution of a nucleotide in a sense codon leads to transformation of a sense codon into another sense one or into a stop one. In the first case mutation can be silent, i.e. the resulting protein will not be changed at all, or, even if new amino acid is different, the protein may preserve its functionality due to locality of modification in protein structure. Therefore, the mutant protein would probably have similar 8

properties as the original one and would perform its functions correctly. In the case of nonsense mutation, i.e. transformation from sense codon to stop one, the initial gene sequence will be truncated. As a result, the protein will lose its functional properties with high probability. Hence, minimizing the number of vulnerable codons in the genetic code markup makes a cell more robust to point mutations. Our results indicate that among all genetic code markups with 3 stop codons the standard markup has the maximum possible probability of terminating gene reading process in the case of frameshift mutation and minimal number of sense codons which can be transformed to a stop one by point mutation. Thus, in its class the standard markup assures the best protection against possible damage in the cases of frameshift and point mutations. These findings support the general hypothesis that the genetic code is not a frozen accident but on the contrary, it is a result of evolution. References 1. Crick, F.H.C., Griffith, J.S., Orgel, L.E. (1957). Codes without commas. Proc. Natl. Acad. Sci. U.S.A. 43: 416-421. 2. Crick F. (1968). The origin of the Genetic Code. J. Mol. Biol. 38, 367-379. 3. Freeland S.J., Hurst L.D. The genetic code is one in a million// J. Mol. Evol. 1998. N47, p.238-248. 4. Goodarzi H, Nejad HA, Torabi N. On the optimality of the genetic code, with the consideration of termination codons. Biosystems. 2004 Nov;77(1-3):163-73. 5. Gusev V.A., Schulze-Makuch D. (2004). Genetic code: lucky chance or fundamental law of nature? Physics of Life Reviews. v.1. issue 3. p. 202-229. 6. Trainor L.E.H. The triplet genetic code. Key to living organisms. World Scientific, 2001. 7. Woese, C.R. (1965) Order in the genetic code. Proc. Natl. Acad. Sci. U.S.A. 54, 71-75. 8. Naumenko S.A., Podlazov A.V. On extreme properties of the genetic code markup. Keldysh Institute for Applied Mathematics. 2005. (in Russian). 9

reading direction a A T G T A T A G C A G T C C C b A Cys Ile Ala Val T G T A T A G C A G T C C C Met Tyr Ser Ser Pro c A T G T A T A G Val Ter Figure 1 Gene reading with shift. (a) If the gene is read without a shift, it codes protein P1. However, if the reading frame is shifted by one nucleotide to the left (shift 1) (b) or to the right (shift 2) (c), then a different protein will be synthesized. But the reading with shift may result in the appearance of a stop codon as in case (c). 10

Codon 1 Shift 2 A T G G C 1 2 3 4 5 Shift 1 A 6 Codon 2 Figure 2 A pair of codons with numbered nucleotide positions 11

Missense mutation Sense codon Sense codon? Nonsense mutation Stop codon Invulnerable codon Vulnerable codon? Figure 3 Point mutations 12

8000 7000 ps 6000 The number of marku 5000 4000 3000 2000 1000 0 114 120 126 132 138 144 150 156 162 168 174 180 186 192 The number of terminating codon pairs Figure 4 The distribution of genetic code markups vs the number of terminating pairs of codons for the genetic code markups with 3 stop codons 13

The number of markups Optimums according to criterion 2a Optimums according to criterion 2a and 1 5500 5000 4500 4000 3500 3000 2500 2000 1500 1000 500 50 0 0 0 1 2 3 4 5 6 7 8 9 550 500 450 400 350 300 250 200 150 100 The number of stop codons Figure 5 Markups with the different numbers of stop codons. Powers of optimum sets. 14

Table 1 The classification of genetic code markups with 3 stop codons vs the number of vulnerable codons and the number of nonsense mutations Number of Number of Number of code markups Variant Group vulnerable codons nonsense mutations Total Rate 1 A 18 23 1 728 4,15% 2 B 19 21 192 0,46% 3 C 20 25 3 456 8,29% 4 C 21 25 5 184 12,44% 5 C 23 25 5 184 12,44% 6 D 21 27 1 152 2,76% 7 D 22 27 1 728 4,15% 8 D 23 27 10 368 24,88% 9 D 25 27 10 368 24,88% 10 D 27 27 2 304 5,53% 15

Table 2 Extreme properties of genetic code markups with 2, 3 and 4 stop codons Number of stop codons in a genetic code markup 2 3 4 Total markups 2016 41664 635376 Maximal number of terminating pairs for both shifts 256 384 512 Number of markups with maximum of terminating pairs 564 2432 4968 Minimal number of vulnerable codons 14 18 20 Number of markups with minimum of vulnerable codons 288 1728 432 Number of markups possessing both extremes 156 528 120 16