关于遗传密码中误差最小化的一些数学改进
Some mathematical refinements concerning error minimization in the genetic code
摘要:
与随机选择的代码相比,遗传密码已经显示出非常的错误鲁棒性,但是与通过启发式算法找到的特定代码相比,错误鲁棒性明显较低。我们制定这个优化问题作为一个二次分配问题,从而验证了代码的启发式找到的是全局最优的。我们还认为,这是强烈的误导比较的遗传密码只与代码从固定块模型采样,因为真正的代码空间是数量级更大。因此,我们将随机码的采样空间从大约2.433 × 10^18个码扩大到大约5.908 × 10^45个码。我们通过离开固定的块模型,并使用摆动规则来制定遗传密码可接受的特征。通过放宽更多限制,还建造了三个更大的空间。使用修改后的误差函数,发现遗传密码是更错误的鲁棒性相比,随机生成的代码的背景下,随着空间大小的增加。我们指出,这些结果并不一定意味着代码在进化过程中优化错误最小化,但其他机制可以解释这种错误鲁棒性。
英文摘要:
The genetic code has been shown to be very error robust compared to randomly selected codes, but to be significantly less error robust than a certain code found by a heuristic algorithm. We formulate this optimisation problem as a Quadratic Assignment Problem and thus verify that the code found by the heuristic is the global optimum. We also argue that it is strongly misleading to compare the genetic code only with codes sampled from the fixed block model, because the real code space is orders of magnitude larger. We thus enlarge the space from which random codes can be sampled from approximately 2.433 x 10^18 codes to approximately 5.908 x 10^45 codes. We do this by leaving the fixed block model, and using the wobble rules to formulate the characteristics acceptable for a genetic code. By relaxing more constraints three larger spaces are also constructed. Using a modified error function, the genetic code is found to be more error robust compared to a background of randomly generated codes with increasing space size. We point out that these results do not necessarily imply that the code was optimized during evolution for error minimization, but that other mechanisms could explain this error robustness.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。