3 research outputs found

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

    Get PDF
    <p>Abstract</p> <p>Background</p> <p>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.</p> <p>Results</p> <p>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.</p> <p>Conclusions</p> <p>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.</p

    Assessing the robustness of genetic codes and genomes

    Full text link
    Deux approches principales existent pour Ă©valuer la robustesse des codes gĂ©nĂ©tiques et des sĂ©quences de codage. L'approche statistique est basĂ©e sur des estimations empiriques de probabilitĂ© calculĂ©es Ă  partir d'Ă©chantillons alĂ©atoires de permutations reprĂ©sentant les affectations d'acides aminĂ©s aux codons, alors que l'approche basĂ©e sur l'optimisation repose sur le pourcentage d’optimisation, gĂ©nĂ©ralement calculĂ© en utilisant des mĂ©taheuristiques. Nous proposons une mĂ©thode basĂ©e sur les deux premiers moments de la distribution des valeurs de robustesse pour tous les codes gĂ©nĂ©tiques possibles. En se basant sur une instance polynomiale du ProblĂšme d'Affectation Quadratique, nous proposons un algorithme vorace exact pour trouver la valeur minimale de la robustesse gĂ©nomique. Pour rĂ©duire le nombre d'opĂ©rations de calcul des scores et de la borne supĂ©rieure de Cantelli, nous avons dĂ©veloppĂ© des mĂ©thodes basĂ©es sur la structure de voisinage du code gĂ©nĂ©tique et sur la comparaison par paires des codes gĂ©nĂ©tiques, entre autres. Pour calculer la robustesse des codes gĂ©nĂ©tiques naturels et des gĂ©nomes procaryotes, nous avons choisi 23 codes gĂ©nĂ©tiques naturels, 235 propriĂ©tĂ©s d'acides aminĂ©s, ainsi que 324 procaryotes thermophiles et 418 procaryotes non thermophiles. Parmi nos rĂ©sultats, nous avons constatĂ© que bien que le code gĂ©nĂ©tique standard soit plus robuste que la plupart des codes gĂ©nĂ©tiques, certains codes gĂ©nĂ©tiques mitochondriaux et nuclĂ©aires sont plus robustes que le code standard aux troisiĂšmes et premiĂšres positions des codons, respectivement. Nous avons observĂ© que l'utilisation des codons synonymes tend Ă  ĂȘtre fortement optimisĂ©e pour amortir l'impact des changements d'une seule base, principalement chez les procaryotes thermophiles.There are two main approaches to assess the robustness of genetic codes and coding sequences. The statistical approach is based on empirical estimates of probabilities computed from random samples of permutations representing assignments of amino acids to codons, whereas, the optimization-based approach relies on the optimization percentage frequently computed by using metaheuristics. We propose a method based on the first two moments of the distribution of robustness values for all possible genetic codes. Based on a polynomially solvable instance of the Quadratic Assignment Problem, we propose also an exact greedy algorithm to find the minimum value of the genome robustness. To reduce the number of operations for computing the scores and Cantelli’s upper bound, we developed methods based on the genetic code neighborhood structure and pairwise comparisons between genetic codes, among others. For assessing the robustness of natural genetic codes and genomes, we have chosen 23 natural genetic codes, 235 amino acid properties, as well as 324 thermophilic and 418 non-thermophilic prokaryotes. Among our results, we found that although the standard genetic code is more robust than most genetic codes, some mitochondrial and nuclear genetic codes are more robust than the standard code at the third and first codon positions, respectively. We also observed that the synonymous codon usage tends to be highly optimized to buffer the impact of single-base changes, mainly, in thermophilic prokaryotes
    corecore