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序列中所有的最大串联重复。
应用推荐