编码问题仍是目前DNA计算中的重点和难点之一,实践证明通过有效的编码设计能够提高DNA计算过程中可靠性.本文介绍了约束条件的生物学特性,分析了约束条件与编码数量的关系,并给出编码的计数公式.文中设计了一种基于三字母表{A,T,C}的线性码的编码构造算法,并对运行结果进行了比较分析,同时分析了结果编码的热力学性质.最后指出DNA计算编码存在的问题及下一步的研究方向.
The encoding problem is a most fundamental issue in DNAbased computing, and lots of experiments have shown that the reliability of this new paradigm can be improved significantly through appropriate encoding strategy. This paper introduces various constraints and the relation between them and the number of words might attained over three-letter alphabet {A, T, C}. Then we present a construction algorithm based on linear codes. Finally, we point out some problems and directions needed further studying.