高级检索
    陈治平 李小龙 王 雷 林亚平 蔡立军. 最佳匹配问题的DNA表面计算模型[J]. 计算机研究与发展, 2005, 42(7): 1241-1246.
    引用本文: 陈治平 李小龙 王 雷 林亚平 蔡立军. 最佳匹配问题的DNA表面计算模型[J]. 计算机研究与发展, 2005, 42(7): 1241-1246.
    Chen Zhiping, Li Xiaolong, Wang Lei, Lin Yaping, and Cai Lijun. A Surface-Based DNA Algorithm for the Perfect Matching Problem[J]. Journal of Computer Research and Development, 2005, 42(7): 1241-1246.
    Citation: Chen Zhiping, Li Xiaolong, Wang Lei, Lin Yaping, and Cai Lijun. A Surface-Based DNA Algorithm for the Perfect Matching Problem[J]. Journal of Computer Research and Development, 2005, 42(7): 1241-1246.

    最佳匹配问题的DNA表面计算模型

    A Surface-Based DNA Algorithm for the Perfect Matching Problem

    • 摘要: 基于最佳匹配问题的问题解空间,采用荧光标记的策略,给出了一种新的最佳匹配问题的DNA表面计算模型,该模型首先将问题解空间的DNA分子固定在固体载体上,然后通过进行相应的生化反应来求得最佳匹配问题的所有解.与已有的最大匹配问题的DNA表面计算模型相比,新模型在检测边的过程中不需要使用观察法,且边的排列顺序不影响解空间的生成过程.因此,新模型具有更好的性能.

       

      Abstract: Using the method of fluorescence labeling, a new DNA algorithm of the perfect matching problem based surface is presented in this paper. By fixing the DNA molecules of the solution space on the solid carrier, all solutions of the perfect matching problem by the biochemical actions can be acquired. Compared with other surface-based DNA algorithms for maximal matching problem, this algorithm can precisely get the edges existing in any perfect matching without using observation, and the edge order hasn't influence on the solution generating process. Therefore, the new algorithm can get better performance.

       

    /

    返回文章
    返回