Rosen G
Department of Physics, Drexel University, Philadelphia, PA 19104.
Bull Math Biol. 1991;53(6):845-51. doi: 10.1007/BF02461487.
Disconnected recurrences of the stop signal, serine and arginine appear in the original representation of the genetic code, and of the stop signal, arginine, serine and leucine in the codon ring representation. To achieve connectedness along with structural continuity, a rook's tour representation is presented here. On the basis of structural similarities and disparities in their side groups, each of the 20 amino acids is associated with a domain comprised of from one to six contiguous squares on the chess board. As the rook moves on the chess board, it reaches all 64 squares in the ordering of the codon numbers, which prescribe the codons by a simple formula based on the position and size of the nucleotides in a triplet. Recurrences of the stop signal, arginine and serine occur naturally on the tour as the rook enters each of the latter domains for the second time. A mathematical equivalent of the rook's tour may enter as a programming device in the implementation of the code by the RNAs.
终止信号、丝氨酸和精氨酸的不连续重现出现在遗传密码的原始表示中，以及终止信号、精氨酸、丝氨酸和亮氨酸在密码子环表示中。为了实现连通性以及结构连续性，这里提出一种车遍历表示法。基于20种氨基酸侧链基团的结构相似性和差异，每种氨基酸都与棋盘上由一到六个相邻方格组成的一个区域相关联。当车在棋盘上移动时，它按照密码子编号的顺序遍历所有64个方格，这些编号通过一个基于三联体中核苷酸位置和大小的简单公式来规定密码子。当车第二次进入后面的每个区域时，终止信号、精氨酸和丝氨酸的重现自然会出现在遍历过程中。车遍历的数学等价形式可以作为一种编程手段，在RNA执行密码的过程中引入。
