It helps us to find a good criterion for sequence design in DNA computing.
这有助于为DNA计算的序列设计找到好的评判标准。
DNA computing is a new method for computation using the technology in molecular biology.
dna计算是应用分子生物技术进行计算的新方法。
DNA computing model and algorithm for the minimal covering problems by plasmids were presented.
给出了图的最小顶点覆盖问题的质粒DNA计算模型及其实现算法。
DNA computing is a new research field that combines both the computer science and molecular biology.
DNA计算是计算科学和分子生物学相结合的新领域。
This article first introduces the basic idea of DNA computation, then presents DNA computing method for solving NP-complete problems.
本文主要介绍了DNA计算的基本思想及解决NP完全问题的DNA计算方法。
The structure of DNA molecules, principle of DNA computing and its implementation method are introduced in chapter two in this paper;
本论文在第二章详细介绍了DNA分子的结构、计算机理及实现方式；
DNA computing is a new calculation method, and the sticker system is an abstract DNA computing model that based on sticking operations.
DNA计算是一种新兴的计算方式，粘贴系统模型是其中基于粘贴运算的一种DNA计算的抽象模型。
DNA computing is a new calculation method that used biological molecule DNA as calculation medium and biochemical reaction as calculation tool.
dna计算是一种以生物分子DNA作为计算介质，以生物化学反应作为计算工具的一种新型计算方法。
In this paper, some problems on algorithm and coding are studied within DNA computing, which is the most popular subfield of biomolecular computing.
本文探讨了生物计算中最受关注的DNA计算中的一些算法及编码问题。
Algorithm of DNA computing for time-table problem was obtained with introducing manifold biochemical experiments on closed circle DNA computing model.
基于闭环dna计算模型引入多种生化实验得出求解排课表问题的DNA算法。
This work improves the capability of representing and dealing with data and extends the range of solving numerical optimization problems in DNA computing.
该工作可提高DNA计算中表示和处理数值的能力，扩展DNA计算求解最优化问题的范围。
We develop support system for sequence design in DNA computing, which minimizes the evaluation function calculated as the linear sum of the plural evaluation terms.
我们给出了DNA计算中序列设计的支持系统：计算由多个评价指标的线性和组成的适应值函数的最小值。
In this paper, the NP-complete problem in combination and optimization having been solved with DNA computing is mainly introduced, and the complexity of these methods is analyzed briefly.
主要介绍了目前利用DNA计算已经解决的组合优化中的NP -完全问题，并简单地分析了它们的复杂性。
This paper firstly introduces the significance of DNA coding and DNA sequences sets for DNA computing, and then gives the definitions of the Hamming distance and reverse Hamming distance constraints.
文中首先介绍了研究DNA编码和DNA序列集合对DNA计算的意义，并给出了DNA序列设计的汉明距离和反汉明距离约束条件的定义。
This paper firstly introduces the significance of DNA coding and DNA sequences sets for DNA computing, and then gives the definitions of the Hamming distance and reverse Hamming distance constraints.
文中首先介绍了研究DNA编码和DNA序列集合对DNA计算的意义，并给出了DNA序列设计的汉明距离和反汉明距离约束条件的定义。
应用推荐