CoChat

Exceptional error minimization in putative primordial genetic codes

Open access
Novozhilov, Artem S, Koonin, Eugene V · 2009 · Biology Direct

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

Abstract

BACKGROUND: The standard genetic code is redundant and has a highly non-random structure. Codons for the same amino acids typically differ only by the nucleotide in the third position, whereas similar amino acids are encoded, mostly, by codon series that differ by a single base substitution in the third or the first position. As a result, the code is highly albeit not optimally robust to errors of translation, a property that has been interpreted either as a product of selection directed at the minimization of errors or as a non-adaptive by-product of evolution of the code driven by other forces. RESULTS: We investigated the error-minimization properties of putative primordial codes that consisted of 16 supercodons, with the third base being completely redundant, using a previously derived cost function and the error minimization percentage as the measure of a code's robustness to mistranslation. It is shown that, when the 16-supercodon table is populated with 10 putative primordial amino acids, inferred from the results of abiotic synthesis experiments and other evidence independent of the code's evolution, and with minimal assumptions used to assign the remaining supercodons, the resulting 2-letter codes are nearly optimal in terms of the error minimization level. CONCLUSION: The results of the computational experiments with putative primordial genetic codes that contained only two meaningful letters in all codons and encoded 10 to 16 amino acids indicate that such codes are likely to have been nearly optimal with respect to the minimization of translation errors. This near-optimality could be the outcome of extensive early selection during the co-evolution of the code with the primordial, error-prone translation system, or a result of a unique, accidental event. Under this hypothesis, the subsequent expansion of the code resulted in a decrease of the error minimization level that became sustainable owing to the evolution of a high-fidelity translation system. REVIEWERS: This article was reviewed by Paul Higgs (nominated by Arcady Mushegian), Rob Knight, and Sandor Pongor. For the complete reports, go to the Reviewers' Reports section.

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-4-44

Cites

75 of 75 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 A 2-letter code consisting of 16 supercodons with the assignment inferred from the list of 'early' amino acids (1) and the parsimony principle.
Figure 1 A 2-letter code consisting of 16 supercodons with the assignment inferred from the list of 'early' amino acids (1) and the parsimony principle.CC BY · PubMed Central
Figure 2 The order of stabilities of base interaction in the first two codon positions of the standard code according to Travers [30]. The green highlighting shows the cells that correspond to the supercodons encoding the 'early' amino acids (1). The only difference from the list (1) is shown in blue.
Figure 2 The order of stabilities of base interaction in the first two codon positions of the standard code according to Travers [30]. The green highlighting shows the cells that correspond to the supercodons encoding the 'early' amino acids (1). The only difference from the list (1) is shown in blue.CC BY · PubMed Central
Figure 3 Error minimization level of 2-letter codes. Starting from a random permutation of amino acids assignments within the supercodons without question marks, optimization was performed to find the least costly assignment according (see Methods). (a) 9 amino acids, the optimum coincides with the code in Fig. 1, MP = 1; (b) additional assignment of Leu is included; the optimum differs from the code in Fig. 1 by permutations in the second column, MP = 0.986; (c) Leu and Ser are added, MP = 0.985; (d) only Ser is added, the optimum is the same code as in Fig. 1, MP = 1.
Figure 3 Error minimization level of 2-letter codes. Starting from a random permutation of amino acids assignments within the supercodons without question marks, optimization was performed to find the least costly assignment according (see Methods). (a) 9 amino acids, the optimum coincides with the code in Fig. 1, MP = 1; (b) additional assignment of Leu is included; the optimum differs from the code in Fig. 1 by permutations in the second column, MP = 0.986; (c) Leu and Ser are added, MP = 0.985; (d) only Ser is added, the optimum is the same code as in Fig. 1, MP = 1.CC BY · PubMed Central
Figure 4 Distributions of random code costs obtained by permutation of amino acid assignments to the supercodons without question marks in Fig. 2. The green line shows the cost of the code from Fig. 1, and the red line shows the mean of the distribution. (a) 9 amino acids from Fig. 2a are used, the distance from the mean to the red line is 2.2 standard deviations; (b) Ser is added to the list of the 9 amino acids, the distance from the mean to the red line is 2.5 standard deviations.
Figure 4 Distributions of random code costs obtained by permutation of amino acid assignments to the supercodons without question marks in Fig. 2. The green line shows the cost of the code from Fig. 1, and the red line shows the mean of the distribution. (a) 9 amino acids from Fig. 2a are used, the distance from the mean to the red line is 2.2 standard deviations; (b) Ser is added to the list of the 9 amino acids, the distance from the mean to the red line is 2.5 standard deviations.CC BY · PubMed Central
Figure 5 A 2-letter code consisting of 16 supercodons assigned according to the list of the 'early' amino acids (1), the parsimony principle, and the '4-column' theory. Dark green cells are those that are assigned in Fig. 1, and question marks in Fig. 1 are replaced with amino acid assignments from the respective column.
Figure 5 A 2-letter code consisting of 16 supercodons assigned according to the list of the 'early' amino acids (1), the parsimony principle, and the '4-column' theory. Dark green cells are those that are assigned in Fig. 1, and question marks in Fig. 1 are replaced with amino acid assignments from the respective column.CC BY · PubMed Central
Figure 6 Error minimization level of 2-letter codes. Starting from a random permutation of amino acids assignments among the supercodons highlighted in Fig. 5, optimization was performed to find the least costly assignment. (a) 9 amino acids, the optimum code is shown, MP = 0.94; (b) The number of supercodons coding for Leu is fixed to 2; MP = 0.987.
Figure 6 Error minimization level of 2-letter codes. Starting from a random permutation of amino acids assignments among the supercodons highlighted in Fig. 5, optimization was performed to find the least costly assignment. (a) 9 amino acids, the optimum code is shown, MP = 0.94; (b) The number of supercodons coding for Leu is fixed to 2; MP = 0.987.CC BY · PubMed Central
Figure 7 The distributions of random code costs for the experiments in Fig. 6. The green line shows the cost of the code from Fig. 5, the red line shows the mean of the distributions. (a) 9 amino acids from Fig. 5, the distance from the mean to the red line is 2.16 standard deviations; (b) Two supercodons assigned for Leu; the distance from the green line to the mean is 2.6 standard deviations.
Figure 7 The distributions of random code costs for the experiments in Fig. 6. The green line shows the cost of the code from Fig. 5, the red line shows the mean of the distributions. (a) 9 amino acids from Fig. 5, the distance from the mean to the red line is 2.16 standard deviations; (b) Two supercodons assigned for Leu; the distance from the green line to the mean is 2.6 standard deviations.CC BY · PubMed Central
Figure 8 Error minimization level of 2-letter codes. (a) A 2-letter code obtained using the parsimony principle. For the cells with an ambiguous assignment, one random amino acid is chosen; (b) The distribution of the costs of the random 2-letter codes obtained by permutation of amino acid assignments in (a), the green lines shows the cost of the code from (a), the red line shows the mean, and the blue line shows the cost of the optimum; MP = 0.51, the distance from the mean is 2.6 standard deviations.
Figure 8 Error minimization level of 2-letter codes. (a) A 2-letter code obtained using the parsimony principle. For the cells with an ambiguous assignment, one random amino acid is chosen; (b) The distribution of the costs of the random 2-letter codes obtained by permutation of amino acid assignments in (a), the green lines shows the cost of the code from (a), the red line shows the mean, and the blue line shows the cost of the optimum; MP = 0.51, the distance from the mean is 2.6 standard deviations.CC BY · PubMed Central
Figure 9 The effects of individual amino acid assignments on the error minimization level of 2-letter codes similar to the code in Fig. 8a. Amino acid frequencies are shown for the random codes (see text for details) for which MP is equal to or higher than the given value. For instance, there are no codes containing Trp which with MP > 0.9, and no codes containing Tyr with MP > 0.8.
Figure 9 The effects of individual amino acid assignments on the error minimization level of 2-letter codes similar to the code in Fig. 8a. Amino acid frequencies are shown for the random codes (see text for details) for which MP is equal to or higher than the given value. For instance, there are no codes containing Trp which with MP > 0.9, and no codes containing Tyr with MP > 0.8.CC BY · PubMed Central
Figure 10 Error minimization levels of 2-letter codes. (a) A 2-letter genetic code obtained using the parsimony principle. For the cells with ambiguous assignment, one random amino acid is chosen; two supercodons, UAN and UGN, are disregarded; (b) The distribution of the costs of random 2-letter codes obtained by permutation of amino acid assignments in (a), the green line shows the cost of the code in (a), the red line shows the mean, and the blue line shows the optimum; MP = 0.88, the distance from the mean is 3.7 standard deviations.
Figure 10 Error minimization levels of 2-letter codes. (a) A 2-letter genetic code obtained using the parsimony principle. For the cells with ambiguous assignment, one random amino acid is chosen; two supercodons, UAN and UGN, are disregarded; (b) The distribution of the costs of random 2-letter codes obtained by permutation of amino acid assignments in (a), the green line shows the cost of the code in (a), the red line shows the mean, and the blue line shows the optimum; MP = 0.88, the distance from the mean is 3.7 standard deviations.CC BY · PubMed Central
Figure 11 Error minimization levels of 2-letter codes. (a) A 2-letter code similar to that in Figure but with fixed assignments for 3 amino acids (dark green); (b) optimal code found by permutation of amino acid assignments in (a), MP = 0.91.
Figure 11 Error minimization levels of 2-letter codes. (a) A 2-letter code similar to that in Figure but with fixed assignments for 3 amino acids (dark green); (b) optimal code found by permutation of amino acid assignments in (a), MP = 0.91.CC BY · PubMed Central
Figure 12 Error minimization levels of 2-letter codes. (a) A 2-letter code obtained using the parsimony principle, with two fixed amino acid assignments shown by dark green highlighting; (b) the result of optimization of the code by permutation of amino acid assignments in (a); (c) the distribution of the costs of random codes, the green line shows the cost of the code in (a), the red line shows the mean, and the blue line shows the optimum; MP = 0.98, the distance from the mean is 3.75 standard deviations.
Figure 12 Error minimization levels of 2-letter codes. (a) A 2-letter code obtained using the parsimony principle, with two fixed amino acid assignments shown by dark green highlighting; (b) the result of optimization of the code by permutation of amino acid assignments in (a); (c) the distribution of the costs of random codes, the green line shows the cost of the code in (a), the red line shows the mean, and the blue line shows the optimum; MP = 0.98, the distance from the mean is 3.75 standard deviations.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?

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 75 references

Cited by

See all 41

Metadata

Authors
Novozhilov, A. S., & Koonin, E. V.
Affiliations
National Institutes of Health (US)
Corresponding author
Koonin, Eugene V
Venue
Biology Direct
Published
2009
Volume
4
Issue
1
Pages
44
ISSN
1745-6150 (ISSN-L)
OpenAlex
W2172088040
Cited by
37
References
75
Citations by year
2026: 4 · 2025: 1 · 2024: 2 · 2023: 2 · 2022: 1 · 2021: 2 · 2020: 4 · 2019: 1 · 2018: 3 · 2017: 4 · 2016: 1 · 2015: 3 · 2014: 2 · 2013: 2 · 2012: 1
FWCI
0.67
Type
journal article
Language
en
Open access
Licence
cc-by
Locations
  • Biology Direct (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University)
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
  • Physical Sciences › Physics and Astronomy › Astronomy and Astrophysics › Origins and Evolution of Life
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Genetics › Evolution and Genetic Dynamics
Keywords
error reduction, translation errors, translation robustness, code evolution, abiotic synthesis, early selection, cost function
MeSH terms
Amino Acid Sequence, Amino Acids, Codon, Genetic Code, Models, Genetic, Molecular Sequence Data

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: Exceptional error minimization in putative primordial genetic codes. https://app.cochat.ai/papers/10.1186/1745-6150-4-44
The paper
Novozhilov, A. S., & Koonin, E. V. (2009). Exceptional error minimization in putative primordial genetic codes. Biology Direct. https://doi.org/10.1186/1745-6150-4-44

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.