一种基于关键路径法的DNA计算用寡核苷酸序列设计算法

A sequences designing algorithm for DNA computation based on critical path method

在原有的生物大分子序列比对算法的基础上,结合图论中的关健路径法,提出了一种新的计算两寡核苷酸序列间最大配对程度的算法。采用此算法结合生成并测试的方法,能够寻找给定长度的一组适用于DNA计算的寡核苷酸序列。同时采用DNA芯片杂交方法验证了用该算法设计的一组序列的杂交特异性。

Based on the original biological macro molecule alignment algorithm and combined with critical path method in graph theory, an algorithm to calculate the maximal matches between two oligonucleotides was proposed. By using this algorithm and generate- and - test method, a group of oligonucleotides of a given length for DNA computation can be searched. A group of sequences designed by this algorithm were tested by hybridization on DNA chips.