Dissertation > Excellent graduate degree dissertation topics show
Research Basic Operations in DNA Computing
Author: ZhengHui
Tutor: GuoPing
School: Chongqing University
Course: Applied Computer Technology
Keywords: DNA computing Basic operations Hamilton Path Problem Figure minimum vertex cover problem
CLC: TP38
Type: Master's thesis
Year: 2010
Downloads: 58
Quote: 1
Read: Download Dissertation
Abstract
|
DNA computing has become a hot topic of research on new computer. DNA computing is a Biomolecular Structure using molecular biological techniques to the new method of calculation, creating a precedent biochemical reaction as computing tools. Huge parallel DNA computing has become a new method to solve a difficult computational problems showing its huge potential, especially in solving NP-hard problem, has joined the growing number of researchers . The main source of DNA single-stranded or double-stranded DNA computing, constitute the bases of the DNA chain is widely present in vivo, computing resources are very rich. In recent years, research on DNA computing has been from the beginning of the experimental phase gradually moved to the practical stage; gradually develop into a diversified technology from a single type of technology; amplification for complex structures from simple structure gradually. With the continuous development of biotechnology, the application of biological operations on DNA computing is also increasing. The rapid development of modern molecular biology, DNA computing, molecular biological operations will gradually maturing and simple, which provides a broad space and good prospects for the development of DNA computing. Currently, the research and development of DNA computing and DNA computer speed is astonishing, and have a lot of progress in theoretical studies and experimental research. Based DNA computing has solved many problems, in-depth analysis of the more mature development of modern molecular biology and biochemical operation, mainly the following aspects of the research work carried out in accordance with the division of the experiment: ① basic operation of this article by the existing solutions the operation of the problem of induction, summarize, compare, refine and present a unified computing basic operation in accordance with the division of the DNA of the experimental process is divided into the following three phases: experimental preparation stage, the calculation stage, read out the solution phase. (2) test tube method and surface distinguish this paper the basic operation of the basic operations divided according to the experimental procedure, based on in vitro and were divided based on the surface, in order to use expressed in different experimental. ③ divided in accordance with the experimental process of DNA computing basic operation, representation based on test tube the way Hamilton path problem and solving the problem based on the surface the way for the minimal coverage. This paper the basic operation expressed two typical difficult calculation, promotion to the formulation of other similar problems, and a computer simulation program is designed to prove that DNA computing able to solve difficult problems in polynomial time, to achieve a unified basic DNA operation solving process. This paper in-depth introduction to the basic principle of operation of biological and chemical processes, complex operation simplistic operation further resolve the molecular biology polysemy, after we study the establishment of a relatively simple platform, and without too much concern about the basic principles of operation behind, convenient for representation problem solutions.
|
Related Dissertations
- Research on Combinatorial Optimization Problem Based on DNA Self-Assemble,TP399-C8
- Arithmetic Operation by Biological Technology,TP301.6
- Research on Optimization Method of DNA Sequence Design in DNA Computing,TP301.6
- Research on Encryption Scheme Based on DNA Technology,TN918.4
- The Design of Boolean Logic Gates Based on DNA Computing,TN79
- Application of DNA Computing in the Combinatorial Optimization Problem,O224
- The Research and Application of DNA Computing by Self-assembly,O242.1
- The Coding Sequence of DNA Computing and Algorithm Theory,O157.4
- The GA in the DNA Computing of the Research and Application,TP18
- The Design and Implementation of DNA Computing Model Based on 0-1 Programming,TP3
- Study on Some Theories of DNA Computing,TP301.6
- Research on DNA Computing Methods of Optimization Problems on Weighted Graph,TP301.6
- The Research on Several Theoretic Problems of DNA Computer,TP18
- The Study on Some Theories and Applications in Four Types of DNA Computing Models,TP301
- A Study on Compound-Agent and Its Application to the Enterprise Management Information System,TP315
- Optical Interconnection Networks for the Massively Parallel Processors,TP338.6
- Research on Collaborative Manufacturing Resources Optimization Deployment Based on DNA Genetic Algorithm,TH166
- Analysis and Research on the Intelligent Method of Industry Robot Motion Control,TP242
- Study on Models of Protein Structure Prediction,Q51
- Research on DNA Computing Model and Experiment for Graph Vertex Coloring Problem,TP301
CLC: > Industrial Technology > Automation technology,computer technology > Computing technology,computer technology > Other computers
© 2012 www.DissertationTopic.Net Mobile
|