Searching of Code Space for an Error-Minimized Genetic Code Via Codon Capture Leads to Failure, or Requires At Least 20 Improving Codon Reassignments Via the Ambiguous Intermediate Mechanism

Abstract

The standard genetic code (SGC) has a fundamental error-minimizing property which has been widely attributed to the action of selection. However, a clear mechanism for how selection can give rise to error minimization (EM) is lacking. A search through a space of alternate codes (code space) via codon reassignments would be required, to select a code optimized for EM. There are two commonly discussed mechanisms of codon reassignment; the Codon Capture mechanism, which proposes a loss of the codon during reassignment, and the Ambiguous Intermediate mechanism, which proposes that the codon underwent an ambiguous phase during reassignment. When searching of code space via the Codon Capture mechanism is simulated, an optimized genetic code can rarely be achieved (0–3.2% of the time) with most searches ending in failure. When code space is searched via the Ambiguous Intermediate mechanism, under constraints derived from empirical observations of codon reassignments from extant genomes, the searches also often end in failure. When a local minimum is avoided and optimization is achieved, 20–41 sequential improving codon reassignments are required. Furthermore, the structures of the optimized codes produced by these simulations differ from the structure of the SGC. These data are challenges for the Adaptive Code hypothesis to address, which proposes that the EM property was directly selected for, and suggests that EM is simply a byproduct of the addition of amino acids to the expanding code, as described by the alternative ‘Emergence’ hypothesis.