首页 | 本学科首页   官方微博 | 高级检索  
     

DNA折纸术在一类特殊的整数规划问题中的应用
引用本文:唐震,殷志祥,崔建中,杨静,孙侠.DNA折纸术在一类特殊的整数规划问题中的应用[J].计算机工程与应用,2019,55(16):49-54.
作者姓名:唐震  殷志祥  崔建中  杨静  孙侠
作者单位:安徽理工大学 数学与大数据学院,安徽 淮南,232001;安徽理工大学 电气与信息工程学院,安徽 淮南,232001
基金项目:国家自然科学基金;国家自然科学基金;安徽省自然科学基金
摘    要:基于DNA折纸术设计并找出一类特殊的整数规划问题的最优解。将这类整数规划问题中的n个变量及对应的所有可能值设计成一条长链(脚手架链),通过添加相应的订书钉链形成发夹结构来映射出问题的解。当整数规划问题中有n个变量时,它的解可以映射成n个发夹结构(长链的长度为l+nt)。同时对于非解,通过添加订书钉链的方法来增加长链的发夹结构,从而使得长链的长度变长(超过l+nt),再通过凝胶电泳来排除这些非解,最后保留可行解。

关 键 词:DNA折纸术  DNA自组装  整数规划

DNA Origami for an Application of Special Integer Programming Problem
TANG Zhen,YIN Zhixiang,CUI Jianzhong,YANG Jing,SUN Xia.DNA Origami for an Application of Special Integer Programming Problem[J].Computer Engineering and Applications,2019,55(16):49-54.
Authors:TANG Zhen  YIN Zhixiang  CUI Jianzhong  YANG Jing  SUN Xia
Affiliation:1.School of Mathematics and Big Data, Anhui University of Science and Technology, Huainan, Anhui 232001, China 2.School of Electronic and Information Engineering, Anhui University of Science and Technology, Huainan, Anhui 232001, China
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 structures are formed by adding the corresponding staples, then, the hairpin structures are used to map out the problem solution. When the integer programming problem hasn]variables, its solution can be mapped onton]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 solutions are retained.
Keywords:DNA origami  DNA self-assembly  integer programming  
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号