CoChat

Evolution of the genetic code: partial optimization of a random code for robustness to translation error in a rugged fitness landscape

Open access

The DOI matches its Crossref record; 67 of the 67 references it cites were found in a registry or an index.

Abstract

Background: The standard genetic code table has a distinctly non-random structure, with similar amino acids often encoded by codons series that differ by a single nucleotide substitution, typically, in the third or the first position of the codon. It has been repeatedly argued that this structure of the code results from selective optimization for robustness to translation errors such that translational misreading has the minimal adverse effect. Indeed, it has been shown in several studies that the standard code is more robust than a substantial majority of random codes. However, it remains unclear how much evolution the standard code underwent, what is the level of optimization, and what is the likely starting point. Results: We explored possible evolutionary trajectories of the genetic code within a limited domain of the vast space of possible codes. Only those codes were analyzed for robustness to translation error that possess the same block structure and the same degree of degeneracy as the standard code. This choice of a small part of the vast space of possible codes is based on the notion that the block structure of the standard code is a consequence of the structure of the complex between the cognate tRNA and the codon in mRNA where the third base of the codon plays a minimum role as a specificity determinant. Within this part of the fitness landscape, a simple evolutionary algorithm, with elementary evolutionary steps comprising swaps of four-codon or two-codon series, was employed to investigate the optimization of codes for the maximum attainable robustness. The properties of the standard code were compared to the properties of four sets of codes, namely, purely random codes, random codes that are more robust than the standard code, and two sets of codes that resulted from optimization of the first two sets. The comparison of these sets of codes with the standard code and its locally optimized version showed that, on average, optimization of random codes yielded evolutionary trajectories that converged at the same level of robustness to translation errors as the optimization path of the standard code; however, the standard code required considerably fewer steps to reach that level than an average random code. When evolution starts from random codes whose fitness is comparable to that of the standard code, they typically reach much higher level of optimization than the standard code, i.e., the standard code is much closer to its local minimum (fitness peak) than most of the random codes with similar levels of robustness. Thus, the standard genetic code appears to be a point on an evolutionary trajectory from a random point (code) about half the way to the summit of the local peak. The fitness landscape of code evolution appears to be extremely rugged, containing numerous peaks with a broad distribution of heights, and the standard code is relatively unremarkable, being located on the slope of a moderate-height peak. Conclusion: The standard code appears to be the result of partial optimization of a random code for robustness to errors of translation. The reason the code is not fully optimized could be the trade-off between the beneficial effect of increasing robustness to translation errors and the deleterious effect of codon series reassignment that becomes increasingly severe with growing complexity of the evolving system. Thus, evolution of the code can be represented as a combination of adaptation and frozen accident. Reviewers: This article was reviewed by David Ardell, Allan Drummond (nominated by Laura Landweber), and Rob Knight. Open Peer Review: This article was reviewed by David Ardell, Allan Drummond (nominated by Laura Landweber), and Rob Knight.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1186/1745-6150-2-24

Cites

67 of 67 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 The standard genetic code. The codon series are shaded in accordance with the PRS (Polar Requirement Scale) values [6], which is a measure of an amino acid's hydrophobicity: the greater hydrophobicity the darker the shading.
Figure 1 The standard genetic code. The codon series are shaded in accordance with the PRS (Polar Requirement Scale) values [6], which is a measure of an amino acid's hydrophobicity: the greater hydrophobicity the darker the shading.CC BY · PubMed Central
Figure 2 Comparison of the standard code with random alternatives for different amino acid substitution matrices and cost functions (1). Z-score is the distance, measured in standard deviations, between the mean of random code costs and the standard code cost. ϕ1, ϕ2, ϕ3 are the cost functions (1) where f(c) is the frequency of codon c; ϕ4, ϕ5, ϕ6 are the cost functions (1) for f(c) = 1 ϕ7, ϕ8, ϕ9;are the cost functions (1) where f(c) is the respective amino acid frequency; in ϕ1, ϕ4, ϕ7 p(c'|c) = 1 for any c and c' that differ by 1 nucleotide, and p(c'|c) = 0 otherwise; ϕ2, ϕ5, ϕ8 incorporate the inferred transition-transversion bias, i.e., p(c'|c) = trb if c and c' differ by a transition, and p(c'|c) = 1 if cand c' differ by a transversion (trb = 2 in our calculations); ϕ3, ϕ6, ϕ9 use the scheme (2).
Figure 2 Comparison of the standard code with random alternatives for different amino acid substitution matrices and cost functions (1). Z-score is the distance, measured in standard deviations, between the mean of random code costs and the standard code cost. ϕ1, ϕ2, ϕ3 are the cost functions (1) where f(c) is the frequency of codon c; ϕ4, ϕ5, ϕ6 are the cost functions (1) for f(c) = 1 ϕ7, ϕ8, ϕ9;are the cost functions (1) where f(c) is the respective amino acid frequency; in ϕ1, ϕ4, ϕ7 p(c'|c) = 1 for any c and c' that differ by 1 nucleotide, and p(c'|c) = 0 otherwise; ϕ2, ϕ5, ϕ8 incorporate the inferred transition-transversion bias, i.e., p(c'|c) = trb if c and c' differ by a transition, and p(c'|c) = 1 if cand c' differ by a transversion (trb = 2 in our calculations); ϕ3, ϕ6, ϕ9 use the scheme (2).CC BY · PubMed Central
Figure 3 Distribution of code scores (set o) obtained as a result of optimization of random codes. The green line is the cost of the standard code, the blue line is the cost of the code which was obtained by minimization of the standard code, the red line is the mean of the distribution. (a)PRS; (b)Gilis matrix.
Figure 3 Distribution of code scores (set o) obtained as a result of optimization of random codes. The green line is the cost of the standard code, the blue line is the cost of the code which was obtained by minimization of the standard code, the red line is the mean of the distribution. (a)PRS; (b)Gilis matrix.CC BY · PubMed Central
Figure 4 The results of optimization of the random codes with cost values lower than the cost of the standard code (set R). The PRS was used as the measure of amino acid substitution cost. (a) Distribution of the code scores from R; the green line is the cost of the standard code; (b) Distribution of the scores for the codes obtained by optimization of the codes from R (set O), the blue line is the cost of the code obtained by optimization of the standard code; (c) Minimization percentage of the codes from O (see text for details); the blue line is the minimization percentage of the standard code.
Figure 4 The results of optimization of the random codes with cost values lower than the cost of the standard code (set R). The PRS was used as the measure of amino acid substitution cost. (a) Distribution of the code scores from R; the green line is the cost of the standard code; (b) Distribution of the scores for the codes obtained by optimization of the codes from R (set O), the blue line is the cost of the code obtained by optimization of the standard code; (c) Minimization percentage of the codes from O (see text for details); the blue line is the minimization percentage of the standard code.CC BY · PubMed Central
Figure 5 The results of optimization of the random codes with cost values lower than the cost of the standard code (set R). The Gillis matrix was used as the measure of amino acid substitution cost. (a) Distribution of the code scores from R; the green line is the cost of the standard code; (b) Distribution of the scores for the codes obtained by optimization of the codes from R (set O), the blue line is the cost of the code obtained by optimization of the standard code; (c) Minimization percentage of the codes from O (see text for details); the blue line is the minimization percentage of the standard code.
Figure 5 The results of optimization of the random codes with cost values lower than the cost of the standard code (set R). The Gillis matrix was used as the measure of amino acid substitution cost. (a) Distribution of the code scores from R; the green line is the cost of the standard code; (b) Distribution of the scores for the codes obtained by optimization of the codes from R (set O), the blue line is the cost of the code obtained by optimization of the standard code; (c) Minimization percentage of the codes from O (see text for details); the blue line is the minimization percentage of the standard code.CC BY · PubMed Central
Figure 6 Projection of the code maps onto the plane of the first two principal components (see text for details). Red 'x' signs, random codes, r; red circles, codes resulting from optimization of random codes, o; green squares, random codes that perform better than the standard code, R; green asterisks, codes resulting from optimization of the set R, O; blue square, the standard code; blue asterisk, the code resulting from the optimization of the standard code. (a) PRS; (b) the Gilis matrix.
Figure 6 Projection of the code maps onto the plane of the first two principal components (see text for details). Red 'x' signs, random codes, r; red circles, codes resulting from optimization of random codes, o; green squares, random codes that perform better than the standard code, R; green asterisks, codes resulting from optimization of the set R, O; blue square, the standard code; blue asterisk, the code resulting from the optimization of the standard code. (a) PRS; (b) the Gilis matrix.CC BY · PubMed Central
Figure 7 Evolutionary dynamics of mean code scores in the course of minimization using the PRS as the measure of amino acid substitution cost. (a) The black circles show the mean score of the evolving random codes in the course of minimization vs arbitrary time units (pairwise swaps). Crosses show the mean values ± one standard deviation. The green line shows the cost of the standard code, and the blue shows the cost of the code that was obtained by minimization of the standard one. The top x-axis is the number of codes that did not reach their local minimum at the preceding step (starting from 300 random codes). The evolution of each code was followed until the code could not be improved anymore. (b) The number of codes that need exactly k pairwise swaps to reach minimum vs k; the blue line is the number of steps for the standard code to reach its local fitness peak (9); the red line is the mean of the distribution (19). (c) Same as (a) but the search started with 100 random codes that outperform the standard code. (d) Same as (b) but the search started with 100 random codes that outperform the standard code.
Figure 7 Evolutionary dynamics of mean code scores in the course of minimization using the PRS as the measure of amino acid substitution cost. (a) The black circles show the mean score of the evolving random codes in the course of minimization vs arbitrary time units (pairwise swaps). Crosses show the mean values ± one standard deviation. The green line shows the cost of the standard code, and the blue shows the cost of the code that was obtained by minimization of the standard one. The top x-axis is the number of codes that did not reach their local minimum at the preceding step (starting from 300 random codes). The evolution of each code was followed until the code could not be improved anymore. (b) The number of codes that need exactly k pairwise swaps to reach minimum vs k; the blue line is the number of steps for the standard code to reach its local fitness peak (9); the red line is the mean of the distribution (19). (c) Same as (a) but the search started with 100 random codes that outperform the standard code. (d) Same as (b) but the search started with 100 random codes that outperform the standard code.CC BY · PubMed Central
Figure 8 Evolutionary dynamics of mean code scores in the course of minimization using the Gillis matrix as the measure of amino acid substitution cost. (a) The black circles show the mean score of the evolving random codes in the course of minimization vs arbitrary time units (pairwise swaps). Crosses show the mean values ± one standard deviation. The green line shows the cost of the standard code, and the blue shows the cost of the code that was obtained by minimization of the standard one. The top x-axis is the number of codes that did not reach their local minimum at the preceding step (starting from 300 random codes). The evolution of each code was followed until the code could not be improved anymore. (b) the number of codes that need exactly k pairwise swaps to reach minimum vs k; the blue line is the number of steps for the standard code to reach its local fitness peak (9); the red line is the mean of the distribution (19); (c) Same as (a) but the search started with 100 random codes that outperform the standard code; (d) Same as (b) but the search started with 100 random codes that outperform the standard code.
Figure 8 Evolutionary dynamics of mean code scores in the course of minimization using the Gillis matrix as the measure of amino acid substitution cost. (a) The black circles show the mean score of the evolving random codes in the course of minimization vs arbitrary time units (pairwise swaps). Crosses show the mean values ± one standard deviation. The green line shows the cost of the standard code, and the blue shows the cost of the code that was obtained by minimization of the standard one. The top x-axis is the number of codes that did not reach their local minimum at the preceding step (starting from 300 random codes). The evolution of each code was followed until the code could not be improved anymore. (b) the number of codes that need exactly k pairwise swaps to reach minimum vs k; the blue line is the number of steps for the standard code to reach its local fitness peak (9); the red line is the mean of the distribution (19); (c) Same as (a) but the search started with 100 random codes that outperform the standard code; (d) Same as (b) but the search started with 100 random codes that outperform the standard code.CC BY · PubMed Central
Figure 9 Evolution of codes in a rugged fitness landscape (a cartoon illustration).r1, r2 ∈ r: random codes with the same block structure as the standard code. o1, o2 ∈ o: codes obtained from r1, r2 ∈ r: after optimization. R1, R2 ∈ R: random codes with fitness values greater than the fitness of the standard code. O1, O2 ∈ O: codes obtained from R1, R2 ∈ R: after optimization.
Figure 9 Evolution of codes in a rugged fitness landscape (a cartoon illustration).r1, r2 ∈ r: random codes with the same block structure as the standard code. o1, o2 ∈ o: codes obtained from r1, r2 ∈ r: after optimization. R1, R2 ∈ R: random codes with fitness values greater than the fitness of the standard code. O1, O2 ∈ O: codes obtained from R1, R2 ∈ R: after optimization.CC BY · PubMed Central

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

2 more claims about this paper

Create a free account to see every claim other papers make about this one.

See all claims — free account

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 67 references

Cited by

See all 122

Metadata

Authors
Novozhilov, A. S., Wolf, Y. I., & Koonin, E. V.
Affiliations
National Institutes of Health (US)
Corresponding author
Koonin, Eugene V
Venue
Biology Direct
Published
2007-10-23
Volume
2
Issue
1
Pages
24-24
ISSN
1745-6150 (ISSN-L)
OpenAlex
W2163198599
Cited by
122
References
67
Citations by year
2026: 13 · 2025: 3 · 2024: 1 · 2023: 7 · 2022: 10 · 2021: 8 · 2020: 5 · 2019: 7 · 2018: 13 · 2017: 9 · 2016: 7 · 2015: 4 · 2014: 6 · 2013: 6 · 2012: 2
FWCI
2.39
Type
journal article
Language
en
Open access
Licence
cc-by
Locations
  • Biology Direct (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • U.S. Department of Health and Human Services
  • National Institutes of Health
  • U.S. National Library of Medicine
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › RNA and protein synthesis mechanisms
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Genetics › Evolution and Genetic Dynamics
  • Physical Sciences › Physics and Astronomy › Astronomy and Astrophysics › Origins and Evolution of Life
Keywords
genetic code evolution, codon degeneracy, fitness landscape ruggedness, evolutionary trajectories, evolutionary algorithms, origin of the genetic code, codon usage bias
MeSH terms
Algorithms, Codon, Genetic Code, RNA, Messenger, RNA, Transfer, Selection, Genetic, Protein Biosynthesis, Evolution, Molecular

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Evolution of the genetic code: partial optimization of a random code for robustness to translation error in a rugged fitness landscape. https://app.cochat.ai/papers/10.1186/1745-6150-2-24
The paper
Novozhilov, A. S., Wolf, Y. I., & Koonin, E. V. (2007). Evolution of the genetic code: partial optimization of a random code for robustness to translation error in a rugged fitness landscape. Biology Direct. https://doi.org/10.1186/1745-6150-2-24

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.