According to the character of the problem, a DNA algorithm solving the Minimum Spanning Tree problem is given.
根据问题的特征，提出了一个求解最小支撑树问题的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反应即可读取问题的可行解。
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序列中所有的最大串联重复。
This paper proposed a new pairwise local alignment algorithm for DNA sequences based-on variable-length segments splice(short for VLSSA).
提出一种基于可变长子片段对拼接的DNA双序列局部比对算法。
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算法，分别使用扩展的分离操作和扩展的多级分离操作实现了该算法。
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算法，分别使用扩展的分离操作和扩展的多级分离操作实现了该算法。
应用推荐