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计算是计算科学和分子生物学相结合的新领域。
Study on the DNA coding for DNA computing and Genetic Algorithms is implemented in this dissertation.
本文对DNA计算的DNA编码和遗传算法进行了研究。
To general 0-1 Integer Programming problem problem, we present a semi-roboticized DNA computing model.
对一般的0 - 1整数规划问题提出了一种半自动化的DNA计算模型。
An algorithm of weighted matching problem is put forward basing on model of closed circle DNA computing.
针对赋权匹配问题，给出了基于闭环dna计算模型的赋权匹配问题算法。
DNA computing has become the forefront of international scientific research within the field of a new hot spot.
DNA计算已经形成国际科学前沿领域内研究的一个新的热点。
The idea to use parameterized algorithm to deduce the space complexity of DNA computing is given in the second chapter.
在第二章中，提出了把参数算法应用于生物计算，以减少生物计算的空间复杂度的思想。
DNA computing model plays an important role in the study field of DNA computing. It is significance to study DNA computing model.
DNA计算模型在DNA计算的各个研究领域中占有重要的地位，对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 computation method with simulating molecular biology structure of DNA and by means of molecular biology technology.
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算法。
What's really needed, according to most researchers in the field, is a"killer" application particularly suited for the way DNA computing solves problems.
＂生物计算机研究领域里的大多数研究人员都认为，他们真正需要的是一个特别适合dna运算技术解决问题方式的＂非常能够说明问题＂的应用领域。
DNA computing is a novel method for solving a class of intractable computational problem, in which the computing can grow exponentially with problem size.
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计算中序列设计的支持系统：计算由多个评价指标的线性和组成的适应值函数的最小值。
Basic thinking of DNA computing is introduced in this paper, then the solution of SAT problem is introduced. After this, we introduce the principle and design of molecular beacons.
本文首先介绍了dna计算的基本思想，然后介绍发夹结构在解决SAT问题上的应用，再介绍发夹结构的一种特殊形式-分子信标的原理和设计方法。
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序列设计的汉明距离和反汉明距离约束条件的定义。
Over the past few years, some insightful researchers have bridged the gap between the biological computing theory and actual DNA-based computation.
在过去几年里，一些富有卓见的研究人员已经衔接了生物计算和实际的DNA计算之间的间隙。
The main features of DNA computer are massively parallel computing ability and potential enormous data storage capacity.
DNA计算机最大的特点是超大规模的并行运算能力和潜在的巨大的数据储存能力。
DNA molecular biology algorithm has the advantages of huge parallelism and high computing speed;
DNA分子生物算法具有高度的并行性，运算速度快；
DNA molecular biology algorithm has the advantages of huge parallelism and high computing speed;
DNA分子生物算法具有高度的并行性，运算速度快；
应用推荐