| 可满足性问题的一种DNA表面计算模型 |
| |
| 引用本文： | 刘文君,殷志祥.可满足性问题的一种DNA表面计算模型[J].计算机与数字工程,2012,40(10):16-17,30. |
| |
| 作者姓名： | 刘文君 殷志祥 |
| |
| 作者单位： | 安徽理工大学理学院 淮南 232001 |
| |
| 基金项目： | 国家自然科学基金(61170172,60873144,61073102,60973050)项目资助 |
| |
| 摘 要： | 可满足性问题的一种DNA表面计算模型是一种特殊的DNA计算方法,该模型是采用荧光标记的策略和荧光猝灭技术,通过观察荧光灭光情况排除非解,从而有效的解决可满足性问题(SAT).该模型方法具有错误率低、编码简单、读取方便等很好的性能,能够大大减少实验过程中的错差.
|
| 关 键 词： | 可满足性问题 DNA表面计算模型 |
A Surface-based DNA Algorithm for the Satisfiability Problem |
| |
| LIU Wenjun
,
YIN Zhixiang.A Surface-based DNA Algorithm for the Satisfiability Problem[J].Computer and Digital Engineering,2012,40(10):16-17,30. |
| |
| Authors: | LIU Wenjun YIN Zhixiang |
| |
| Affiliation: | (Department of Mathematics and Physics,Anhui University of Science and Technology,Huainan 232001) |
| |
| Abstract: | A surface-based DNA algorithm is a kind of special DNA computing technology.The DNA algorithm can effectively solve the satisfiability(SAT) problem by using the method of fluorescence labeling and fluorescence quenching technology and observing the fluorescence light off situation from solution.The DNA algorithm has better performance such as low error rate,simple coding,convenient reading,which can greatly reduce the error of experimental process. |
| |
| Keywords: | satisfiability problem surface-based DNA algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
