检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]武汉工业学院数理科学系
出 处:《华中科技大学学报(自然科学版)》2008年第8期107-110,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)
基 金:国家自然科学基金资助项目(60403002);湖北省自然科学基金资助项目(2007ABA407);湖北省教育厅重点教研项目资助课题(20040248)
摘 要:讨论了DNA计算的机理,给出了DNA计算的基本生化实验.对电路布线问题,提出了DNA算法,即首先对导线的顺序进行DNA编码,其次通过杂交反应产生所有可行解,最后通过电泳实验得到最优解.对所得结果进行检测时采用了DNA芯片和分子信标技术,对探针进行生物素标记解读出最优解.该算法的核心运算是杂交反应,算法总的操作次数为n+3,其中n为电路布线问题的规模.最后,通过6对接线柱的例子说明了DNA算法的有效性和正确性.The principle of DNA computing was discussed and basal experiments of biochemistry of DNA computing were put forward. DNA algorithm of distributing circuitry problem was brought forward. First the orders of wires were encoded with DNA encoding. Then all feasible solutions could be obtained by hybridization experiment. Finally optimization solution could be obtained using the technique of electrophoresis. When testing experimental results, technique of DNA chip and molecule beaconing was used to mark the probe with biotin and optimization solution could be unscrambled. Pivotal operation of the DNA algorithm was the hybridization experiment. All times of operation of the DNA algorithm is n+3. The n is the size of distributing circuitry problem. Finally, validity and correctness of the DNA algorithm were explained for example of 6 pairs' connection pole.
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.37