基于粘贴模型的两类全排问题的DNA算法

基于粘贴模型的巨大并行性，分别给出了线性全排列和圆周全排列问题的粘贴DNA算法；分析了两类问题的DNA算法的不同之处；通过一个实例给出了实验操作步骤，并对生化实验进行了模拟，得出了正确的结果，从而证明了算法的可行性。最后，对算法的操作复杂度进行了分析。

DNA algorithm of two kinds of full permutation problem based on sticker model

Sticker DNA algorithms of linear full permutation and circle full permutation are proposed based on the vast parallelism of sticker model,and the differences between the algorithms are illustrated.The operation steps are given through an instance,and simulation experiments are carried out to illustrate the biochemical processes.The final correct results are gotten. Consequently,the feasibilities of the algorithms are proved.At last,the complexities are analyzed.