Finally, complexity of the DNA algorithm is discussed.
最后讨论了算法的复杂性。
According to the character of the problem, a DNA algorithm solving the Minimum Spanning Tree problem is given.
根据问题的特征，提出了一个求解最小支撑树问题的DNA算法。
DNA algorithm for mining optimal ingredient pattern of traditional Chinese medicine is presented here, which is based on plasmid.
提出了一种用于中药配方优化的DNA算法，该算法基于质粒dna技术。
The basal theorem of DNA algorithm for edge-coloring is given and proved, and DNA algorithm on closed circle DNA was designed and realized.
提出并证明了边着色问题的基本定理，设计并实现了闭环dna计算算法。
By using this method a DNA algorithm to solve 0-1 programming problem is proposed and PCR is done only 4 times of to detect the feasible solutions.
基于该编码方法所建立的DNA计算模型可用于求解0-1规划问题，只需4次PCR反应即可读取问题的可行解。
A sticker DNA algorithm is proposed based on the vast parallelism of sticker model, and be carried out it by extended separate and extended multi-separate respectively.
基于粘贴模型的巨大并行性，给出了一类禁位排列问题的粘贴DNA算法，分别使用扩展的分离操作和扩展的多级分离操作实现了该算法。
In this paper we present a new algorithm to locate all maximal tandem repeats in DNA sequence, which is based on a simple data structure called suffix array.
本文提出了一种新的算法，此算法基于一种简单的数据结构后缀数，用于查找给定的DNA序列中所有的最大串联重复。
Algorithm analyses show that the new proposed algorithm based on DNA computation has such good characteristics as simple encoding and low fault rate etc.
算法分析表明，新提出的基于DNA计算的求解算法具有编码简单和错误率低等特点。
In this dissertation, Membrane optimization algorithm is applied in finding sequences suitable for reliable DNA computing in this thesis, a new method of DNA sequence design is pu.
本文采用膜优化算法优化DNA计算编码序列，提出了一类求解dna编码问题的新方法，扩展了膜计算的应用领域。
The idea to use parameterized algorithm to deduce the space complexity of DNA computing is given in the second chapter.
在第二章中，提出了把参数算法应用于生物计算，以减少生物计算的空间复杂度的思想。
An algorithm of weighted matching problem is put forward basing on model of closed circle DNA computing.
针对赋权匹配问题，给出了基于闭环dna计算模型的赋权匹配问题算法。
In the dissertation, DNA sticker algorithm of vertex-coloring problems is given out.
本文给出了图顶点着色问题的DNA粘贴算法。
This paper proposed a new pairwise local alignment algorithm for DNA sequences based-on variable-length segments splice(short for VLSSA).
提出一种基于可变长子片段对拼接的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计算中的一些算法及编码问题。
DNA computing model and algorithm for the minimal covering problems by plasmids were presented.
给出了图的最小顶点覆盖问题的质粒DNA计算模型及其实现算法。
An algorithm was designed to stitch the matched probes derived from DNA chip sequencing.
对DNA芯片测序所得到的匹配探针，设计算法进行拼接。
DNA molecular biology algorithm has the advantages of huge parallelism and high computing speed;
DNA分子生物算法具有高度的并行性，运算速度快；
Despite immune system has many perfect calculation properties, the known immune algorithm models exist many bugs to be used to DNA multiple sequence alignment.
虽然以往的免疫算法有许多优良的计算特性，但在DNA多序列比对(MSA)中已知的免疫算法模型仍有许多不足。
Algorithm of DNA computing for time-table problem was obtained with introducing manifold biochemical experiments on closed circle DNA computing model.
基于闭环dna计算模型引入多种生化实验得出求解排课表问题的DNA算法。
Algorithm of DNA computing for time-table problem was obtained with introducing manifold biochemical experiments on closed circle DNA computing model.
基于闭环dna计算模型引入多种生化实验得出求解排课表问题的DNA算法。
应用推荐