假定原始遗传密码中的异常错误最小化
Exceptional error minimization in putative primordial genetic codes
摘要:
我们研究了错误最小化属性的推定原始代码,由16个超级密码子,第三个基地是完全冗余的,使用以前推导的成本函数和错误最小化百分比作为衡量代码的鲁棒性误译。结果表明,当16-supercodon表填充10个假定的原始氨基酸,推断从非生物合成实验的结果和其他证据独立的代码进化,并与最小的假设用于分配剩余的超级密码子,所得到的2-字母代码是接近最优的误差最小化水平。假定的原始遗传密码在所有密码子中只包含两个有意义的字母,并编码10至16个氨基酸,计算实验的结果表明,这些密码可能是最佳的翻译错误最小化。这种接近最优的特性可能是代码与原始的、容易出错的翻译系统共同进化过程中广泛的早期选择的结果,也可能是一个独特的、偶然事件的结果。在此假设下,随后的扩展代码导致错误最小化水平的下降,由于高保真翻译系统的发展,错误最小化水平变得可持续。
英文摘要:
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 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. 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。