Solid phase based DNA solution of the coloring problem

DNA computing has the potential to tackle computationally difficult problems that have real-world implications.The parallel search capabilities of DNA make it a valuable tool for approaching intractable computational problems,for which conventional computers have limited potentials.Up to now,many accomplishments have been achieved to improve its performance and increase its reliability.In this paper,the coloring problem has been solved by means of molecular biology techniques.The coloring problem is a well-known NP-complete problem.This work represents further evidence for the ability of DNA computing to solve NP-complete problems.     

A surface-based DNA algorithm for the minimal vertex cover problem

Abstract DNA computing was proposed for solving a class of intractable computational problems, of which the computing timewill grow exponentially with the problem size. Up to now, many achievements have been made to improve its performance and increase itsreliability. It has been shown many times that the surface-based DNA computing technique has very low error rate, but the technique hasnot been widely used in the DNA computing algorithms design. In this paper, a surface-based DNA computing algorithm for minimal ver-tex cover problem, a problem well-known for its exponential difficulty, is introduced. This work provides further evidence for the abilityof surface-based DNA computing in solving NP-complete problems.     

脱氧核糖核酸在案例分析中的应用

用脱氧核糖核酸(DNA)作为信息处理的工具,运用图论方法,解决案例分析 中较为复杂的逻辑计算问题,展示了DNA分子计算的光明前景。     

DNA计算技术进展

论述DNA计算技术进展。先介绍DNA计算的基本原理,论述DNA计算的特点方法和存在的问题,接着介绍DNA计算的国内外研究现状,最后指出DNA计算研究中需要解决的问题。     

DNA计算及DNA计算机的研究进展

概述了DNA计算的基本原理、DNA计算的应用和DNA计算机的研究进展及存在问题，基于DNA生化反应的计算机称为DNA计算机，由于其采用一种完全不同于传统计算机的运算逻辑与存贮方式，DNA计算机在解决某些复杂问题时具有传统计算机无法比拟的优势，目前国际上关于DNA计算和DNA分子生物计算机的研究方兴未艾，极大地推进了DNA计算机的研究过程。     

DNA计算机

脱氧核糖核酸（简称DNA）是生物体内的一种具有双螺旋结构的遗传物质,用DNA可以进行运算,即构成的DNA计算机能很快地求解复杂的问题;以DNA编码为信息的载体,DNA计算机中的输入和输出设备都是DNA的,链用一系列二进制的数代表所求问题中的变量,用DNA中特有的寡核苷酸序列表示这些二进制的数,再将DNA利用分子生物和化学组装技术组装到芯片上,利用DNA杂交化学方法,排除各种代表不正确解的寡核苷酸序列,最后通过聚合酶链式反应（PCR）和各种检测技术读出保留在芯片上的DNA序列,读出的DNA序列所代表的二进制数即为所求问题的解,本文将从DNA运算过程入手,介绍DNA计算机的原理和DNA计算机的若干最新研究进展。     

解决NP问题的DNA编码技术

NP问题是密码学中的一个难题,用DNA计算解决NP问题是目前DNA密码研究的一个热点。文章阐述了DNA编码问题及约束条件,归纳出用DNA计算解决NP问题的基本步骤,分析了Adleman解决哈密尔顿回路问题的实验中DNA编码的质量,提出了可选的更好的编码,并总结了目前DNA编码研究中存在的问题。     

Genetic algorithm in DNA computing： A solution to the maximal clique problem

Genetic algorithm is one of the possible ways tobreak the limit of brute-force method in DNA computing.Using the idea of Darwinian evolution, we introduce a geneticDNA computing algorithm to solve the maximal clique prob-lem. All the operations in the algorithm are accessible withtoday‘s molecular biotechnoiogy. Our computer simulationsshow that with this new computing algorithm, it is possible toget a solution from a very small initial data pool, avoidingenumerating all candidate solutions. For randomly generatedproblems, genetic algorithm can give correct solution withina few cycles at high probability. Although the current speedof a DNA computer is slow compared with silicon computers,our simulation indicates that the number of cycles needed inthis genetic algorithm is approximately a linear function ofthe number of vertices in the network. This may make DNAcomputers more powerfully attacking some hard computa-tional problems.     

Sticker DNA computer model ——Part Ⅰ: Theory

Sticker model is one of the basic models in the DNA computer models. This model is coded with single-double stranded DNA molecules. It has the following advantages that the operations require no strands extension and use no enzymes; What‘s more, the materials are reusable.Therefore it arouses attention and interest of scientists in many fields. In this paper, we will systematically analyze the theories and applications of the model, summarize other scientists‘ contributions in this field, and propose our research results. This paper is the theoretical portion of the sticker model on DNA computer, which includes the introduction of the basic model of sticker computing. Firstly, we systematically introduce the basic theories of classic models about sticker computing; Secondly, we discuss the sticker system which is an abstract computing model based on the sticker model and formal languages; Finally, extend and perfect the model, and present two types of models that are more extensive in the applications and more perfect in the theory than the past models: one is the so-called k-bit sticker model, the other is full-message sticker DNA computing model.     

DNA media storage

In 1994, University of Southern California computer scientist, Dr. Leonard Adleman solved the Hamiltonian path problem using DNA as a computational mechanism. He proved the principle that DNA computing could be used to solve computationally complex problems. Because of the limitations in discovery time, resource requirements, and sequence mismatches, DNA computing has not yet become a commonly accepted practice. However, advancements are continually being discovered that are evolving the field of DNA computing. Practical applications of DNA are not restricted to computation alone. This research presents a novel approach in which DNA could be used as a means of storing files. Through the use of multiple sequence alignment combined with intelligent heu- ristics, the most probabilistic file contents can be determined with minimal errors.     

DNA计算研究的新进展

DNA计算(DNA computing)是伴随着分子生物学的兴起和发展而出现的．作为一种全新的算法，DNA计算显示了其进行复杂运算的可行性．该文介绍DNA计算的机理，探讨了目前DNA计算的研究进展，并介绍了表面固定的生物计算和由输入DNA分子同时提供数据和燃料的生物分子自动机．     

图的最小顶点覆盖的粘贴DNA计算模型

本文在对经典粘贴模型以及全信息化的粘贴DNA计算模型的基本方法进行充分讨论的基础上,提出一种用粘贴DNA计算模型解决图的最小顶点覆盖问题的新方案,将数学问题的求解同并行生物操作有效结合.     

DNA粘接计算模型及其应用

DNA计算是应用分子生物技术进行计算的新方法。应用形式语言及自动机理论技术研究DNA计算理论,有利于推动理论计算科学的发展。本文根据DNA分子的结构及特点给出了DNA分子的形式化描述,介绍了DNA粘接计算模型的文法结构和计算能力,并应用DNA计算方法求解3-SAT问题。     

基于DNA链置换反应的编码器逻辑运算模型研究

作为自组装DNA计算领域中一门新技术,DNA链置换反应在分子计算领域得到了广泛的应用.基于自组装DNA计算原理,设计了对应不同逻辑门的DNA分子电路.基于DNA链置换反应机理构建了编码器逻辑电路的分子计算模型.当输入DNA分子信号链时,将不同分子浓度比的DNA分子逻辑门电路混合,借助分子间的特异性杂交反应及分子间链置换反应,最终可输出信号链分子.Visual DSD仿真结果表明了本文设计的编码器逻辑计算模型的可行性与准确性.为拓展分子逻辑电路的应用做出有益的探索.     

DNA media storage

In 1994, University of Southern California computer scientist Dr. Leonard Adleman solved the Hamiltonian path problem using DNA as a computational mechanism. He proved the principle that DNA computing could be used to solve computationally complex problems. Because of the limitations in discovery time, resource requirements, and sequence mismatches, DNA computing has not yet become a commonly accepted practice. However, advancements are continually being discovered that are evolving the field of DNA computing. Practical applications of DNA are not restricted to computation alone. This research presents a novel approach in which DNA could be used as a means of storing files. Through the use of multiple sequence alignment combined with intelligent heuristics, the most probabilistic file contents can be determined with minimal errors.     

蚂蚁DNA提取方法的研究

针对不同体型的蚂蚁,提出了一套实用的总DNA提取方法.该方法依照虫体大小,分别采用冰冻固定后捣碎和剪刀剪碎两种方法破碎虫体,使材料利用充分,提高了提取效率.探讨了组织匀浆、DNA沉淀及溶解等实验中常见问题.结果表明,采用盐析法提取DNA,较传统的酚-氯仿抽提法简单、高效.     

利用发夹结构分子实现栈式结构的DNA计算模型

为使DNA计算机能像电子计算机一样解决数据的组织与存储问题, 提出了一种利用发夹结构分子实现栈式数据结构的DNA计算模型,描述了数据的存储和组织方式以及元素入栈、 出栈等操作的生物操作过程。经验证, DNA计算模型求解数据的组织问题是可行的, 有助于DNA计算机走向实际应用。     

质粒DNA计算模型的计算体系

首先从具体实例入手抽象和归纳出质粒DNA计算模型的概念,并对质粒DNA计算模型计算体系的2个基本要素———计算物质和计算手段进行研究,由此形成了质粒DNA计算模型完备的计算体系;然后针对质粒DNA计算模型计算体系的应用,分析和解决了经常出现的关键问题.讨论了初始质粒DNA重新合成的重要性,并给出了重新合成的方法;接着对计算体系的2个基本实验(酶切和酶连实验)的成功率问题进行了分析,并提出了解决的方案;最后对检测实验进行了分析,提出了检测多种DNA序列的检测方法.对这些问题的分析和解决有利于质粒DNA计算模型理论的完善和应用的拓广.     

New field of cryptography： DNA cryptography

The vast parallelism, exceptional energy efficiency and extraordinary information density inherent in DNA molecules are being explored for computing, data stor- age and cryptography. In such research area, novel computers, data storage and cryptography mi…     

DNA computing on surfaces

DNA computing was proposed as a means of solving a class of intractable computational problems in which the computing time can grow exponentially with problem size (the 'NP-complete' or non-deterministic polynomial time complete problems). The principle of the technique has been demonstrated experimentally for a simple example of the hamiltonian path problem (in this case, finding an airline flight path between several cities, such that each city is visited only once). DNA computational approaches to the solution of other problems have also been investigated. One technique involves the immobilization and manipulation of combinatorial mixtures of DNA on a support. A set of DNA molecules encoding all candidate solutions to the computational problem of interest is synthesized and attached to the surface. Successive cycles of hybridization operations and exonuclease digestion are used to identify and eliminate those members of the set that are not solutions. Upon completion of all the multistep cycles, the solution to the computational problem is identified using a polymerase chain reaction to amplify the remaining molecules, which are then hybridized to an addressed array. The advantages of this approach are its scalability and potential to be automated (the use of solid-phase formats simplifies the complex repetitive chemical processes, as has been demonstrated in DNA and protein synthesis). Here we report the use of this method to solve a NP-complete problem. We consider a small example of the satisfiability problem (SAT), in which the values of a set of boolean variables satisfying certain logical constraints are determined.