Skip to main content
PMC home page
BMC Bioinformatics logoLink to BMC Bioinformatics
. 2011 Feb 21;12:56. doi: 10.1186/1471-2105-12-56

Simulated evolution applied to study the genetic code optimality using a model of codon reassignments

José Santos 1,✉, Ángel Monteagudo 1
PMCID: PMC3053255  PMID: 21338505

Abstract

Background

As the canonical code is not universal, different theories about its origin and organization have appeared. The optimization or level of adaptation of the canonical genetic code was measured taking into account the harmful consequences resulting from point mutations leading to the replacement of one amino acid for another. There are two basic theories to measure the level of optimization: the statistical approach, which compares the canonical genetic code with many randomly generated alternative ones, and the engineering approach, which compares the canonical code with the best possible alternative.

Results

Here we used a genetic algorithm to search for better adapted hypothetical codes and as a method to guess the difficulty in finding such alternative codes, allowing to clearly situate the canonical code in the fitness landscape. This novel proposal of the use of evolutionary computing provides a new perspective in the open debate between the use of the statistical approach, which postulates that the genetic code conserves amino acid properties far better than expected from a random code, and the engineering approach, which tends to indicate that the canonical genetic code is still far from optimal. We used two models of hypothetical codes: one that reflects the known examples of codon reassignment and the model most used in the two approaches which reflects the current genetic code translation table. Although the standard code is far from a possible optimum considering both models, when the more realistic model of the codon reassignments was used, the evolutionary algorithm had more difficulty to overcome the efficiency of the canonical genetic code.

Conclusions

Simulated evolution clearly reveals that the canonical genetic code is far from optimal regarding its optimization. Nevertheless, the efficiency of the canonical code increases when mistranslations are taken into account with the two models, as indicated by the fact that the best possible codes show the patterns of the standard genetic code. Our results are in accordance with the postulates of the engineering approach and indicate that the main arguments of the statistical approach are not enough to its assertion of the extreme efficiency of the canonical genetic code.

Background

The canonical genetic code is not universal although it is present in most complex genomes. Its establishment is still under discussion once the discovery of non-standard genetic codes altered the "frozen accident" [1]. Woese [2] was one of the first to consider the adaptability of the genetic code. He suggested that the patterns within the standard genetic code reflect the physicochemical properties of amino acids. An argument in favor is the fact that in the canonical genetic code the amino acids with similar chemical properties are coded by similar codons.

There are three basic theories on the origin of the organization of the genetic code [3]. The stereochemical theory claims that the origin of the genetic code must lie in the stereochemical interactions between anticodons or codons and amino acids. The second one is the physicochemical theory, which claims that the force defining the origin of the genetic code structure was the one that tended to reduce the deleterious effects of physicochemical distances between amino acids codified by codons differing in one base. The third one is the coevolution hypothesis [4,5], which suggests that the structure of the genetic code reflects the biosynthetic pathways of amino acids through time and the error minimization at the protein level is just a consequence of this process. This coevolution theory suggests that codons, originally assigned to prebiotic precursor amino acids, were progressively assigned to new amino acids derived from the precursors as biosynthetic pathways evolved. For other authors as Higgs [6], the driving force during the build-up of the standard code is not the minimization of the effects of translational error, and the main factor that influenced the positions in which new amino acids were added is that there should be minimal disruption of the protein sequences that were already encoded. Nevertheless, the code that results is one in which the translational error is minimized.

Several previous works have studied the genetic code optimality. Most authors have quantified the efficiency of a possible code taking into account the possible errors in the codon bases. Generally, a measurement of changes in a basic property of the codified amino acids was used considering all the possible mutations in a generated code. The most efficient code is one that minimizes the effects of mutations, as this minimization implies a smaller phenotypic change in the codified proteins.

Once the efficiency of a code has been measured, different criteria are used to assess whether the genetic code is in some sense optimal. These analyses fall into two main classes: statistical [7] and engineering [8]. The first one considers the probability of random codes more efficient than the standard genetic code. With this alternative for measuring code optimality, the standard genetic code is compared with many randomly generated alternative codes. These considerations define the so-called "statistical approach" [7]. Comparing the error values of the standard genetic code and alternative codes indicates, according to the authors using this approach [9-13], the role of selection. The main conclusion of these authors is that the genetic code conserves amino acid properties far better than expected from a random code.

In a first computational experiment with this alternative, Haig and Hurst [12] corroborated that the canonical code is optimized to a certain extent. They found that of 10,000 randomly generated codes, only two performed better at minimizing the effects of errors, when polar requirement [2] was taken as the amino acid property, concluding that the canonical code was a product of natural selection for load minimization. Freeland and Hurst [9] investigated the effect of weighting transition errors differently from transversion errors and the effect of weighting each base differently, depending on reported mistranslation biases. When they used weightings to allow for biases in translation, they found that only one in every million randomly generated alternative codes was more efficient than the standard genetic code.

With a similar methodology, Gilis et al. [14] took into account the frequency at which different amino acids occur in proteins and found that the fraction of random codes that beat the canonical code decreases. Torabi et al. [15] considered both relative frequencies of amino acids and relative gene copy frequencies of tRNAs in genomic sequences which were used as estimates of the tRNA content [16]. Zhu et al. [17] included codon usage differences between species and Marquez et al. [18] tested the idea that organisms optimize their codon usage as well as their genetic code: codons with lower error values might be used in preference to those with higher error values, to reduce the overall probability of errors, although their conclusions were the opposite.

Sammet et al. [19], using a genotype-to-phenotype mapping based on a quantitative model of protein folding, compared the standard genetic code to seven of its naturally occurring variants with respect to the fitness loss associated to mistranslation and mutation. According to the authors' methodology, most of the alternative genetic codes were found to be disadvantageous to the standard code, that is, the standard code is generally better able to reduce the translation load than the naturally occurring variants.

The second alternative for measuring code optimality is the so-called "engineering approach", followed, for example, by Di Giulio [8,20]. The approach uses a "percentage distance minimization" (p.d.m.) which compares the standard genetic code with the best possible alternative. The p.d.m. determines code optimality on a linear scale, as it is calculated as the percentage in which the canonical genetic code is in relation to the randomized mean code and the most optimized code. Therefore, it is defined as (∆mean - ∆code)/(∆mean - ∆low), where ∆mean is the average error value, obtained by averaging over many random codes, and ∆low is the best (or approximated) ∆ value. This approach tends to indicate that the genetic code is still far from optimal.

With this methodology, Di Giulio [21] estimated that the standard genetic code has achieved 68% minimization of polarity distance, by comparing the standard code with random codes that reflect the structure of the canonical code and with the best code that the author obtained by a simulated annealing technique. The author indicates that the minimization percentage can be interpreted as the optimization level reached during genetic code evolution. With this methodology, the authors in [22] also considered the evolution of the code under the coevolution theory. We previously analyzed the evolution of codes within the coevolution theory [23].

We used the mean square (MS) measurement [9,12] (Methods Section) to quantify the relative efficiency of any given code. We considered two possibilities to generate alternative codes: the first one is the model of hypothetical codes that reflects the current genetic code translation table (model 1), which is most used in the literature. Two restrictions were considered [9,12]:

1. The codon space (the 64 codons) was divided into the 21 nonoverlapping sets of codons observed in the standard genetic code, each set comprising all codons specifying a particular amino acid in the standard code.

2. Each alternative code is formed by randomly assigning each of the 20 amino acids to one of these sets. The three stop codons remain invariant in position, these being the same stop codons of the standard code.

This choice of a small part of the vast space of possible codes, with these conservative restrictions, as Novozhilov et al. [24] indicate, "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".

As the codon set structure of the standard genetic code is unchanged, only considering permutations of the amino acids coded in the 20 sets, there are 20! (2.43·1018) possible hypothetical codes. Without restrictions in the mapping of the 64 codons to the 21 labels there would be more than 1.51·1084 general codes [25].

In this work we considered the commented restrictive codes. Nevertheless, as Higgs [6] indicates, none of the known examples of codon reassignment occurs by swapping the amino acids assigned to two codon blocks. Instead, one or more codons assigned to one amino acid are reassigned to another, so one block of codons decreases in size while the other increases. Furthermore, the amino acid that acquires the codon is almost always a neighbor of the one that loses it. As Higgs [6] states, "The reason for this is that reassignments of codons to neighbouring amino acids can be done by changing only a single base in the tRNA anticodon". Hence, we also studied a second alternative with these possible restricted hypothetical codes which consider these codon reassignments (model 2), model not considered in the previous literature.

Methods

The optimality of a code is related to its relative efficiency when different errors are considered in the DNA sequence or in the transcription and translation machinery of the protein synthesis. The efficiency generally considers these possible errors to take into account the possible changes in codified amino acids and their properties [7-18,20-27]. A code which, on average, generates fewer changes is more efficient, as the effects of errors are minimized.

Encoding and genetic operators

An adapted genetic algorithm (GA) [28,29] was used to search for alternative codes that were more optimized than the standard genetic code. Each individual of the genetic population must encode a hypothetical code. Model 1 of alternative codes considered permutations of the amino acids coded in the 20 codon sets observed in the canonical code, so each individual has 20 positions, and each position encodes the particular amino acid associated with the codon set (Figure 1). The use of a simple algorithm ensures that the individuals of the initial population encode the 20 amino acids. Three codons are used for the stop label, which are the same as those of the canonical code.

Figure 1.

Figure 1

Open in a new tab

Evolutionary computing methodology applied to the search for better adapted codes. (a) Each individual of a genetic population encodes a possible hypothetical code, which is evaluated according to its efficiency to changes or mutations in the codon bases. (b) This efficiency defines the fitness of each individual, which is used by the genetic algorithm to select the individuals (c) in which a genetic operator (swap) is applied to define the individuals of the next generation (model 1 of hypothetical codes). (d) This evolutionary process is iterated through generations.

In model 1, the GA used a swap operator. The operator interchanges the contents of two codon sets, that is, once two positions are randomly selected, the amino acids codified by the two respective codon sets are swapped. Figure 1 shows how this operator works.

In model 2 of hypothetical codes each individual has 64 positions, corresponding to the 64 codons. In each hypothetical code, 3 codons are reserved for the stop signal. In this case, the genetic operator models the known codon reassignments [6]. This operator can be summarized as follows:

1. Choose a random codon from the 61 codons that encode an amino acid.

2. The encoded amino acid is copied (duplicated) in another codon (randomly chosen) which differs only in one letter with respect to the first codon. If the amino acid to replace is the only instance in the hypothetical code, then the operator is not applied.

In both models, tournament was used as selection operator. It chooses the best in a window of randomly selected individuals from the population. Hence, the size of the window determines the required selective pressure. Moreover, elitism of the best individual was used, that is, this individual is kept in the next generation without changes.

Fitness function in the Genetic Algorithm

The fitness function was the measurement that calculates the mean square (MS) change in an amino acid property resulting from all possible changes to each base of all the codons within a given code [9,12]. Any one change is calculated as the squared difference between the property value of the amino acid coded for by the original codon and the value of the amino acid coded for by the new (mutated) codon. As most authors [9,12,20-22] we used the polar requirement as the amino acid property. This property can be considered as a measurement of hydrophobicity and it was introduced by Woese as a measurement for the polarity of an amino acid, which is defined as a partitioning coefficient of an amino acid in a water/pyrimidine system [2]. The final error is an average of the effects of all the substitutions over the whole code. Hence, the error ∆ is defined as:

Δ2=∑ij(Xi−Xj)2∑ijNij

where Nij is the number of times the i-th amino acid changes into the j-th amino acid, and Xi is the value of the amino acid property of the i-th amino acid. The changes from and to "stop" codons are ignored, while synonymous changes (the mutated codon encoding the same amino acid) are included in the calculation. The MS value defines the fitness value of a given code and the evolutionary algorithm will try to minimize it.

Results and discussion

We tested the implemented GA, searching for alternative codes, with the two definitions of models of hypothetical codes previously explained. Figure 2 shows the evolution of the MS across the generations of the genetic algorithm. The quality (fitness) of the best individual and the average quality of the population were the result of an average of 50 evolutions with different initial populations. The population size was 1,000 individuals for the different tests and we used tournament selection with a size of 3% of the population. The selected individuals pass to the next generation, applying the suitable genetic operators for each model (Methods Section).

Figure 2.

Figure 2

Open in a new tab

Evolutions of alternative codes with MS and tMS. Evolution of the best individual and the average quality of the population using MS and tMS as fitness with codes that reflect the canonical code translation table (model 1) and with the model of natural codon reassignments (model 2). MS is the average mean square error of the effects of possible changes in the three codon bases. tMS incorporates the quantification of mistranslation in each particular base. These curves of fitness evolution were the result of an average of 50 evolutions with different initial populations. The horizontal lines indicate the corresponding MS or tMS values of the canonical code.

The mean value of the best final codes was 3.506 using model 1, with a low standard deviation of 0.031. The best value found by Freeland and Hurst [9] was 4.7 and the MS value of the standard genetic code is 5.19. The p.d.m., using the best value obtained by the GA, was 71% with these restrictive codes. Figure 2 shows that evolution easily finds better adapted codes, although the p.d.m. value shows good adaptability of the standard genetic code. The p.d.m. with the codes of model 2 was 68%, this value being lower since the freer evolution of codes can obtain better optimal codes.

We repeated the analysis taking into account the errors as a function of the base position in the codon. Table 1 shows the quantification of mistranslation used in [9] as well as in this work to weight the relative efficiency of the three bases. It presents a summary of the empirical data on the frequency of transition and transversion mutations at the three codon positions. The MS is changed to tMS, which weights the errors according to the values shown in Table 1.

Table 1.

Quantification of mistranslation used to weight the relative efficiency of the three bases in the tMS calculation.

Combined weighting First base Second base Third base
For transitions 1 0.5 1
For transversions 0.5 0.1 1
Open in a new tab

Using model 1, there was an increase from a p.d.m. value of 71% in the MS case to a p.d.m. value of 84% when the mistranslation biases were considered in the fitness calculation. Using model 2, the increase was larger, from a p.d.m. value of 68% in the MS case to a value of 89% using tMS. This implies that the standard code is better adapted when we consider the quantification of mistranslations. This agrees with the results obtained in the statistical study of Freeland and Hurst [9] (these authors used only model 1). Note that using the two fitness functions, MS and tMS, model 2 obtains better values, although using tMS the GA needs more generations to overcome the corresponding values found with model 1, so the evolutions with model 2 are shown with more generations. The reason of the better values with model 2 is that, with the movements of this model, there is the possibility to reach the codes obtained with model 1, so the GA has a larger landscape where to find better codes.

The evolution of the quality curves leads to the same conclusion: Evolution requires more generations to obtain a better individual with a better value than that of the canonical code when using tMS. This is clearer with the known codon reassignments model. With the average quality we have the same effect, as the GA has greater difficulty in obtaining better individuals than the canonical code.

Figure 3, with the usual representation of the genetic code, corresponds with the assignments of best evolved codes using MS and tMS in the restrictive codes as well as with the model of codon reassignments. The position of each codified amino acid is shaded by a gray scale representing its polar requirement value. Although there are very different assignments of amino acids with respect to the canonical code, the two alternative restrictive codes present two patterns that are correlated with systematic errors in the processes of replication and translation, which are also present in the standard genetic code [30]. Pattern I: Amino acids are more similar to each other along the first codon position than they are along the second. This "column-like" pattern corresponds to the high rate of translational misreading in the first codon position; Pattern II: Along the second position, amino acids associated with pyrimidine bases (U,C) or purine bases (A,G) are more similar within these sets than between them. This is associated with mutational bias in replication, in which transitions (mutations within these base sets) occur more frequently than transversions (mutations of a base in one set to a base in the other set). Pattern I is present in all the evolved codes except for the evolved code using model 2 and MS, where is more difficult to recognize such pattern. Pattern II is clearer in the best codes with tMS, especially with model 2 of hypothetical codes. This is logical because the tMS variant models the different frequency of transition and transversion mutations.

Figure 3.

Figure 3

Open in a new tab

Tables of best evolved codes with MS and tMS in restrictive codes (model 1), and best evolved codes in the codon reassignments model (model 2). The position of each codified amino acid is shaded by a gray scale, representing its polar requirement value.

The MS or tMS values of each sample of codes in each generation form a probability distribution against which the standard genetic code MS or tMS values may be compared. Figure 4 shows the histograms at four stages of the evolutionary processes: initial population, generations 5, 10 and 50. The histograms of the initial populations present a similar distribution as the ones of Freeland and Hurst [9], as the populations are random. A better code (better than the canonical code) was not found by chance in those initial populations. At the end of the evolutionary processes, the situation changed radically, where most of the individuals showed a better MS/tMS than that of the standard genetic code.

Figure 4.

Figure 4

Open in a new tab

Histograms of different generations of evolutionary runs with both models of hypothetical codes. The histograms correspond to the initial generation, generations 5 and 10, and generation 50 when there is not significant improvement in the evolutionary processes. In the histograms, the x-axis gives a particular range of categories of MS/tMS values whereas the y-axis gives the number of individuals with an MS/tMS in that category. The vertical lines in the histograms indicate the category into which the MS/tMS value of the canonical code falls.

Conclusions

We used a genetic algorithm to search for better adapted hypothetical codes and as a method to guess the difficulty in finding such alternative codes, allowing to clearly situate the canonical code in the fitness landscape. We are emphasizing what simulated evolution search can provide about such difficulty of discovering possible better codes than the canonical one, and we must take into account that our methodology does not provide possible evolutionary pathways by which the canonical code reached its current state, as done by other authors [6].

From our GA simulations we can infer several conclusions. First, our results are not in disagreement with the main result of the statistical approach, as it is shown in the histograms of the initial populations, because such distributions of codes demonstrate, using the MS and tMS cost functions, that the canonical code is much better than random codes. Moreover, we agree with Knight et al. [26] when they state that the code could be trapped in a local, rather than global, optimum, and when they indicate that the average effect of amino acid changes in proteins is unlikely to be perfectly recaptured by a single linear scale of physical properties [26]. Nevertheless, with the information provided by the evolution of the histograms (Figure 4), now we do not agree with the authors who focus their analyses on the statistical approach [7,9-11,27] when they favor it because, as they emphasize, the approach takes into consideration that the possible random codes form a Gaussian distribution of error values [13]. According to the authors, the canonical genetic code is "extremely efficient" [9]. When they used an amino acid similarity based on the PAM 74-100 matrix, Freeland et al. [27] stated "if theoretically possible code structures are limited to reflect plausible biological constraints, and amino acid similarity is quantified using empirical data of substitution frequencies, the canonical code is at or very close to a global optimum for error minimization" [27]. Nevertheless, Di Giulio has questioned this work, as the title of his article "the origins of the genetic code cannot be studied using measurements based on the PAM matrix because this matrix reflects the code itself, making any such analysis tautologous" clearly explains [31].

However, regarding the comments of the authors focused on the statistical approach, even beginning with the Gaussian distributions of random codes in the initial genetic populations, the GA simulations indicate that it is very easy to improve the adaptability level of the standard genetic code. The better codes were obtained with low selective pressure and in few generations. Hence, the canonical code is clearly far from optimal, as also revealed by the position of the optimality values of the canonical code in the curves of quality evolution (Figure 2) for the two models considered. In this sense, we agree with the engineering approach as this alternative tends to indicate that the canonical code is still far from optimal. Nevertheless, the more realistic model of the known codon reassignments shows a slightly better efficiency of the canonical code with respect to the first model, as revealed by the greater difficulty of the GA to overcome the optimality value of the canonical code, as Figures 2 and 4 indicate.

Authors' contributions

JS planned the studies and wrote the manuscript. AM performed the different experiments. Both authors discussed the results and implications and commented on the manuscript at all stages. Both authors read and approved the final manuscript.

Contributor Information

José Santos, Email: santos@udc.es.

Ángel Monteagudo, Email: amonteagudo@cetnaga.com.

Acknowledgements

This work was funded by the Ministry of Science and Innovation of Spain through project TIN2007-64330.

References

  1. Crick F. The origin of the genetic code. Journal of Theoretical Biology. 1968;38:367–379. doi: 10.1016/0022-2836(68)90392-6. [DOI] [PubMed] [Google Scholar]
  2. Woese CR. On the evolution of the genetic code. Proc Natl Acad Sci USA. 1965;54:1546–1552. doi: 10.1073/pnas.54.6.1546. [DOI] [PMC free article] [PubMed] [Google Scholar]
  3. Di Giulio M. The origin of the genetic code: theories and their relationship, a review. Biosystems. 2005;80:175–184. doi: 10.1016/j.biosystems.2004.11.005. [DOI] [PubMed] [Google Scholar]
  4. Wong JT. A co-evolution theory of the genetic code. Proc Natl Acad Sci USA. 1975;72:1909–1912. doi: 10.1073/pnas.72.5.1909. [DOI] [PMC free article] [PubMed] [Google Scholar]
  5. Wong JT. Coevolution theory of the genetic code at age thirty. BioEssays. 2005;27:416–425. doi: 10.1002/bies.20208. [DOI] [PubMed] [Google Scholar]
  6. Higgs PG. A four-column theory for the origin of the genetic code: tracing the evolutionary pathways that gave rise to an optimized code. Biol Direct. 2009;4(16) doi: 10.1186/1745-6150-4-16. [DOI] [PMC free article] [PubMed] [Google Scholar]
  7. Freeland SJ, Knight RD, Landweber LF. Measuring adaptation within the genetic code. Trends in Biochemical Sciences. 2000;25(2):44–45. doi: 10.1016/S0968-0004(99)01531-5. [DOI] [PubMed] [Google Scholar]
  8. Di Giulio M. The origin of the genetic code. Trends in Biochemical Sciences. 2000;25(2):44. doi: 10.1016/S0968-0004(99)01522-4. [DOI] [PubMed] [Google Scholar]
  9. Freeland SJ, Hurst LD. The genetic code is one in a million. Journal of Molecular Evolution. 1998;47(3):238–248. doi: 10.1007/PL00006381. [DOI] [PubMed] [Google Scholar]
  10. Freeland SJ. Genetic Programming and Evolvable Machines. Vol. 3. Kluwer Academic Publishers; 2002. The Darwinian genetic code: An adaptation for adapting? pp. 113–127. [DOI] [Google Scholar]
  11. Freeland SJ, Hurst LD. Load minimization of the genetic code: history does not explain the pattern. Proceedings of The Royal Society. 1998;265:2111–2119. doi: 10.1098/rspb.1998.0547. [DOI] [Google Scholar]
  12. Haig D, Hurst LD. A quantitative measure of error minimization in the genetic code. Journal of Molecular Evolution. 1991;33:412–417. doi: 10.1007/BF02103132. [DOI] [PubMed] [Google Scholar]
  13. Knight RD, Freeland SJ, Landweber LF. Selection, history and chemistry: the three faces of the genetic code. Trends Biochem Sci. 1999;24:241–247. doi: 10.1016/S0968-0004(99)01392-4. [DOI] [PubMed] [Google Scholar]
  14. Gilis D, Massar S, Cerf NJ, Rooman M. Optimality of the genetic code with respect to protein stability and amino-acid frequencies. Genome Biology. 2001;2(11) doi: 10.1186/gb-2001-2-11-research0049. [DOI] [PMC free article] [PubMed] [Google Scholar]
  15. Torabi N, Goodarzi H, Najafabadi HS. The case for an error minimizing set of coding amino acids. Journal of Theoretical Biology. 2007;44(4):737–744. doi: 10.1016/j.jtbi.2006.09.021. [DOI] [PubMed] [Google Scholar]
  16. Goodarzi H, Najafabadi HS, Nejad HA, Torabi N. The impact of including tRNA content on the optimality of the genetic code. Bulletin of Mathematical Biology. 2006;67(6):1355–1368. doi: 10.1016/j.bulm.2005.03.002. [DOI] [PubMed] [Google Scholar]
  17. Zhu C-T, Zeng X-B, Huang W-D. Codon usage decreases the error minimization within the genetic code. Journal of Molecular Evolution. 2003;57:533–537. doi: 10.1007/s00239-003-2505-7. [DOI] [PubMed] [Google Scholar]
  18. Marquez R, Smit S, Knight R. Do universal codon-usage patterns minimize the effects of mutation and translation error? Genome Biology. 2005;6(11):R91. doi: 10.1186/gb-2005-6-11-r91. [DOI] [PMC free article] [PubMed] [Google Scholar]
  19. Sammet SG, Bastolla U, Porto M. Comparison of translation loads for standard and alternative genetic codes. BMC Evolutionary Biology. 2010;10:178. doi: 10.1186/1471-2148-10-178. [DOI] [PMC free article] [PubMed] [Google Scholar]
  20. Di Giulio M, Capobianco MR, Medugno M. On the optimization of the physicochemical distances between amino acids in the evolution of the genetic code. Journal of Theoretical Biology. 1994;168:43–51. doi: 10.1006/jtbi.1994.1086. [DOI] [PubMed] [Google Scholar]
  21. Di Giulio M. The extension reached by the minimization of the polarity distances during the evolution of the genetic code. Journal of Molecular Evolution. 1989;29:288–293. doi: 10.1007/BF02103616. [DOI] [PubMed] [Google Scholar]
  22. Di Giulio M, Medugno M. Physicochemical optimization in the genetic code origin as the number of codified amino acids increases. Journal of Molecular Evolution. 1999;49(1):1–10. doi: 10.1007/PL00006522. [DOI] [PubMed] [Google Scholar]
  23. Santos J, Monteagudo A. Study of the genetic code adaptability by means of a genetic algorithm. Journal of Theoretical Biology. 2010;264(3):854–865. doi: 10.1016/j.jtbi.2010.02.041. [DOI] [PubMed] [Google Scholar]
  24. Novozhilov AS, Wolf YI, Koonin EV. Evolution of the genetic code: partial optimization of a random code for robustness to translation error in a rugged fitness landscape. Biol Direct. 2007;2(24) doi: 10.1186/1745-6150-2-24. [DOI] [PMC free article] [PubMed] [Google Scholar]
  25. Schönauer S, Clote P. In: Computer Science and Biology, German Conference on Bioinformatics (GCB 97) Frishman D, Mewes H, editor. 1997. How optimal is the genetic code? pp. 65–67. [Google Scholar]
  26. Knight RD, Freeland SJ, Landweber LF. In: The Genetic Code and the Origin of Life. Lluís Ribas de Pouplana, editor. Vol. 80. Kluwer Academic/Plenum Publishers; 2004. Adaptive evolution of the genetic code; pp. 175–184. [Google Scholar]
  27. Freeland SJ, Knight RD, Landweber LF, Hurst LD. Early fixation of an optimal genetic code. Mol Biol Evol. 2000;17(4):511–518. doi: 10.1093/oxfordjournals.molbev.a026331. [DOI] [PubMed] [Google Scholar]
  28. Goldberg DE. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co. Inc; 1989. [Google Scholar]
  29. Goldberg DE, Sastry K. Genetic Algorithm: the Design of Innovation, Springer Verlag; 2009. [Google Scholar]
  30. Ardell DH, Sella G. Philosophical Transact ions of the Royal Society of London. Vol. 357. Series B, Biological Sciences; 2002. No accident: genetic codes freeze in error-correcting patterns of the standard genetic code; pp. 1625–1642. [DOI] [PMC free article] [PubMed] [Google Scholar]
  31. Di Giulio M. The origins of the genetic code cannot be studied using measurements based on the PAM matrix because this matrix reflects the code itself, making any such analysis tautologous. Journal of Theoretical Biology. 2001;208(2):141–144. doi: 10.1006/jtbi.2000.2206. [DOI] [PubMed] [Google Scholar]

Articles from BMC Bioinformatics are provided here courtesy of BMC

RESOURCES