z-logo
open-access-imgOpen Access
Analysis of the optimality of the standard genetic code
Author(s) -
Balaji Kumar,
Supreet Saini
Publication year - 2016
Publication title -
molecular biosystems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.942
H-Index - 96
eISSN - 1742-206X
pISSN - 1742-2051
DOI - 10.1039/c6mb00262e
Subject(s) - code (set theory) , genetic code , computer science , biology , computational biology , programming language , genetics , dna , set (abstract data type)
Many theories have been proposed attempting to explain the origin of the genetic code. While strong reasons remain to believe that the genetic code evolved as a frozen accident, at least for the first few amino acids, other theories remain viable. In this work, we test the optimality of the standard genetic code against approximately 17 million genetic codes, and locate 29 which outperform the standard genetic code at the following three criteria: (a) robustness to point mutation; (b) robustness to frameshift mutation; and (c) ability to encode additional information in the coding region. We use a genetic algorithm to generate and score codes from different parts of the associated landscape, which are, as a result, presumably more representative of the entire landscape. Our results show that while the genetic code is sub-optimal for robustness to frameshift mutation and the ability to encode additional information in the coding region, it is very strongly selected for robustness to point mutation. This coupled with the observation that the different performance indicator scores for a particular genetic code are negatively correlated makes the standard genetic code nearly optimal for the three criteria tested in this work.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom