Cargando…
Exceptional error minimization in putative primordial genetic codes
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 t...
Autores principales: | , |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2009
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2785773/ https://www.ncbi.nlm.nih.gov/pubmed/19925661 http://dx.doi.org/10.1186/1745-6150-4-44 |
_version_ | 1782174831157968896 |
---|---|
author | Novozhilov, Artem S Koonin, Eugene V |
author_facet | Novozhilov, Artem S Koonin, Eugene V |
author_sort | Novozhilov, Artem S |
collection | PubMed |
description | 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. |
format | Text |
id | pubmed-2785773 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2009 |
publisher | BioMed Central |
record_format | MEDLINE/PubMed |
spelling | pubmed-27857732009-12-01 Exceptional error minimization in putative primordial genetic codes Novozhilov, Artem S Koonin, Eugene V Biol Direct Research 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. BioMed Central 2009-11-19 /pmc/articles/PMC2785773/ /pubmed/19925661 http://dx.doi.org/10.1186/1745-6150-4-44 Text en Copyright ©2009 Novozhilov and Koonin; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/2.0 This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. |
spellingShingle | Research Novozhilov, Artem S Koonin, Eugene V Exceptional error minimization in putative primordial genetic codes |
title | Exceptional error minimization in putative primordial genetic codes |
title_full | Exceptional error minimization in putative primordial genetic codes |
title_fullStr | Exceptional error minimization in putative primordial genetic codes |
title_full_unstemmed | Exceptional error minimization in putative primordial genetic codes |
title_short | Exceptional error minimization in putative primordial genetic codes |
title_sort | exceptional error minimization in putative primordial genetic codes |
topic | Research |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2785773/ https://www.ncbi.nlm.nih.gov/pubmed/19925661 http://dx.doi.org/10.1186/1745-6150-4-44 |
work_keys_str_mv | AT novozhilovartems exceptionalerrorminimizationinputativeprimordialgeneticcodes AT koonineugenev exceptionalerrorminimizationinputativeprimordialgeneticcodes |