计算机与数字工程2012，Vol.40Issue(10)：16-17,30,3.
可满足性问题的一种DNA表面计算模型
A Surface-based DNA Algorithm for the Satisfiability Problem
摘要
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.关键词
可满足性问题/DNA表面计算模型Key words
satisfiability problem/ surface-based DNA algorithm分类
信息技术与安全科学引用本文复制引用
刘文君,殷志祥..可满足性问题的一种DNA表面计算模型[J].计算机与数字工程,2012,40(10):16-17,30,3.基金项目
国家自然科学基金(61170172,60873144,61073102,60973050)项目资助. （61170172,60873144,61073102,60973050）
