路径排序问题基于表面的DNA算法

提出了路径排序问题表面DNA算法三步骤：a．找出两端点的所有链，b．筛选出所有的路，c．得到路序．指出编码问题在DNA计算中的重要性．在算法实现过程中，用保护两端点对应的DNA片段3’端或5’端的办法得到所有的链，并用电泳的方法对链进行排序以及去掉链长大于图权值总和的链；对探针进行生物素标记并且采用观察、记录亮点强度的办法筛选出所有的路；分析实验记录得到路序．将算法推广到最短（长）路问题的不同之处在第三步，即只需分析在表面上排在最前（最后）的DNA链的实验记录就得到最短（长）路．

Surface-based DNA algorithm for arrangement paths

Given were the three steps of surface-based DNA algorithm for arrangement paths to find out all chains of the two points, to filter all paths, to obtain the gradation of all paths. It was pointed that encoding is important to DNA computing, in the implement of the DNA algorithm, the technique was used which is to safeguard 3 margin or 5 margin of DNA sequence corresponding the two points in order to find out all chains, and electrophoresis could be applied to arrange all chains and to throw off all the chains whose length exceed summation of weigh in graph. The probe with biotin to observe and register intensity of bright point to filter all paths; finally the orders of all paths can be obtained to analyze the recordation of experimentation. The DAN algorithm could be applied to the problem of the shortest (or the longest) path only to analyze the recordation of the front (back) DNA chain.