计算机工程与应用2019，Vol.55Issue(16)：49-54,6.DOI:10.3778/j.issn.1002-8331.1806-0318
DNA折纸术在一类特殊的整数规划问题中的应用
DNA Origami for an Application of Special Integer Programming Problem
摘要
Abstract
A design based on DNA origami is proposed to solve a special integer programming problem. For this kind of integer programming problem, design all possible values of the variables for a long DNA strand(scaffold). Hairpin struc-tures are formed by adding the corresponding staples, then, the hairpin structures are used to map out the problem solu-tion. When the integer programming problem has n variables, its solution can be mapped onto n hairpin structures(the length of the scaffold is l+nt ). For non-solutions, by adding staples to increase the hairpin structures of scaffold, thus the scaffold will lengthen(over l+nt ). These non-solutions are eliminated by gel electrophoresis and the feasible solu-tions are retained.关键词
DNA折纸术/DNA自组装/整数规划Key words
DNA origami/ DNA self-assembly/ integer programming分类
信息技术与安全科学引用本文复制引用
唐震,殷志祥,崔建中,杨静,孙侠..DNA折纸术在一类特殊的整数规划问题中的应用[J].计算机工程与应用,2019,55(16):49-54,6.基金项目
国家自然科学基金(No.61672001,No.61702008) （No.61672001,No.61702008）
安徽省自然科学基金(No.1808085MF193). （No.1808085MF193）
