Largest Group Problems In Dna Computing And Dna Self-assembly Of Related Research

Biological computing is an interdisciplinary subject which is newly developed and flourished in recent years. It mainly consists of biological science, mathematic science and computer science. This arithmetic is distinct to the traditional method. It primarily uses macro biological molecules like DNA and RNA to solve some problems such as NP problem and full NP problem which are hard or cannot be solved through traditional method. However, with the development of scientific research, now the calculations of DNA is not limited.It studies DNA code of encryption and decryption, Biochemistry and medical application and so on. Meanwhile, this arithmetic has its incomparable advantages, for instance, it has massive storage capacity, high parallelism and processing speed. Although it’s only over ten years since this subject came into being, it has made a lot of achievements and greatly developed. Nowadays, there are many researchers both at home and abroad studying this field. They mainly focus on theoretical research, biochemical modeling and biological computer.This research mainly gives a simple introduction and summary about the knowledge of DNA computing, which is a branch of biological computing. Simple elaboration of basic concepts, advantages and disadvantages of DNA study, introduction of basic computational models and DNA self-assembly are involved. Moreover, Maximum Clique Problem (MCP), which is a famous NP problem in math, has been solved via one of the methods in DNA computing.The specific contents of the research are shown as following:1. This article mainly introduces some of the DNA self-assembly models, including sticker model, splicing model, hairpin model, plasmid model, in vitro model, surface model and3D DNA computing model. Each model has its application scope and disadvantages, they’re briefly introduced in the article.Meanwhile, some new technologies are also introduced in the article。2. Maximum Clique Problem (MCP) is a sophisticated problem in computation. It’s one of the21full NP problems raised by Karp. When solving MCP via frequently used methods, too many steps in experiment, inconvenience of operation in vivo and low cyclization efficiency are the confusions. In this article, the method which uses2D DNA(κ-armed DNA molecule) structure to solve MCP is designed. In order to save time and simplify steps of the experiment, this method turns2D DNA into molecular tiler, establishes3D DNA image structure based on2D DNA molecules and constructs the model. This arithmetic is a new way to lower the complexity in solving MCP and it’s also a meaningful practice on research of DNA computer and DNA computer。 This model is only in a theoretical stage in the current, which is not only a disadvantage of the development of the model itself, but also the limitation in all the current molecular computation. Therefore, a further experiment is needed to verify whether it is valid, in other words, to see whether it’s a progress of DNA computing or not.3. Based on DNA computing, a new way of developing DNA, which is called DNA self-assembly, arises. DNA self-assembly is the technology that makes basic structural units form an ordered structure spontaneously under Thermodynamic equilibrium conditions. As the concept of self-assembly has been gradually understood and concerned, it is already applied in many subjects, such as robotic technology, manufacturing, nano-technology, microelectronics and grid systems. The most important example of the usage of self-assembly in material science are formation of crystal, colloid, lipid bilayer, stage separation of complex and monolayer. This article mainly describes how DNA self-assembly developed rapidly from ID to3D. Meanwhile, it introduces some of the currently existed DNA self-assembly tiles, they are DX tile, TX tile, cross tile and n-point-star module. DNA origami is a newly developed direction of DNA self-assembly. With the help of different arithmetic or methods, researchers are able to construct different structures by using DNA. For example, square, rectangle, triangle, smiling face, map of China and many other complicated spatial structures. For DNA self-assembly itself, there exists a huge space of development potential.Last but not the least, superiorities and deficiencies of DNA self-assembly are analyzed at the end of the article, and the development of this subject in the future is looked forward to.