Dissertation > Excellent graduate degree dissertation topics show

The Study on Some Theories and Applications in Four Types of DNA Computing Models

Author: WangShuDong
Tutor: XuJin
School: Huazhong University of Science and Technology
Course: Systems Engineering
Keywords: DNA computing Paste Systems Sticker model Splicing system The minimum vertex cover problem Series parallel graph
CLC: TP301
Type: PhD thesis
Year: 2004
Downloads: 399
Quote: 8
Read: Download Dissertation

Abstract


In this paper, some of the theory and its application in the four types of DNA computing model was studied and discussed, are as follows: paste system is built on the basis of the paste operation language generation, but also a follow Watson-Crick complementary nature of the annealing operation DNA computing abstract model. This article will expand linear string Paste system to a bi-directional the complex structures paste system with a hairpin structure, so that the the paste system's pure research a step forward in technology research to the actual biological operation. The definition of two-way complex structures paste system and its basic operations; proposed two-way classification of complex structures paste; generating capacity and computing power of the two-way system of complex structures paste; Finally, two-way complex structural adhesives and weak coding portrayed the recursive out language, which show that two-way complex structural adhesives and recursive column family of languages ??have the same computing power. Paste the model there is a random access memory, the use of the DNA chain having a fixed length, the operation is not required to extend the DNA chain, and also without enzyme participation, and its material can be reused in theory. In this paper, the DNA of the vertex coloring problem paste algorithm. DNA paste algorithm in the study of graph vertex coloring problem, starting from the nature of the problem, first vertices of the graph coloring problem decomposed into independent set of vertices and vertex partitioning problem and gives these two issues, and then call these two algorithms solve the vertices of the graph coloring problem. Total coloring conjecture is by M.Behzad and Vizing in 1965. So far, for the average figure, the total coloring conjecture is still an open question. Departure from the structural properties of the series parallel graph, the use of dual induction and color change techniques to determine the total chromatic number of series parallel graph. Splicing system is a splicing operation as a basic operator language generator, wherein the splicing operation is the restriction endonuclease, DNA ligase, DNA polymerase and exonuclease, DNA chain reorganization process mathematical abstraction. Using splicing huge parallelism, first designed analog editing systems to the Hamiltonian Path Problem; This splicing system arising from the nature of the language to the Hamiltonian path problem analysis, given a directed graph number of structural nature, and figure there is a necessary and sufficient condition to Hamilton Road. The minimum vertex cover problem is an NP-complete problem in graph theory. In molecular biology, scheduling, error diagnosis and recovery of the assembly line balancing, tanker itinerary and switching theory has a broad should lt; WP = gt;. In this paper, the surface of the DNA computing model of the minimum vertex cover problem modeling. Constructed the vertex collection containing the vertex edges FIG corresponding data pool after cycle of synthesis, hybridization, washing, and degeneration of biological operation, to get all the coverage corresponds to the DNA sequence, and then through the process of addressing the required minimum vertex cover. Finally, through the the vertices edges of Figure model has been verified.

Related Dissertations

  1. Research on Combinatorial Optimization Problem Based on DNA Self-Assemble,TP399-C8
  2. Design and Research of the data structure in DNA computer,TP311.12
  3. The Research on Several Problems of DNA Computing,TP301
  4. Study on Some Theories of DNA Computing,TP301.6
  5. The Design and Implementation of DNA Computing Model Based on 0-1 Programming,TP3
  6. The GA in the DNA Computing of the Research and Application,TP18
  7. The Application of DNA Computation in Information Security,TP309
  8. The Coding Sequence of DNA Computing and Algorithm Theory,O157.4
  9. The Research and Application of DNA Computing by Self-assembly,O242.1
  10. DNA Computing in Graph Theory,O157.5
  11. Application of DNA Computing in the Combinatorial Optimization Problem,O224
  12. The Design of Boolean Logic Gates Based on DNA Computing,TN79
  13. Research on Encryption Scheme Based on DNA Technology,TN918.4
  14. Research on Optimization Method of DNA Sequence Design in DNA Computing,TP301.6
  15. Research Basic Operations in DNA Computing,TP38
  16. Using DNA length coding to achieve molecular computing,Q523
  17. Research of Welding Robot Path Planning Algorithm,TP242
  18. Research on the Application of the DNA Computation in Role-based Access Control System,TP393.08
  19. Arithmetic Operation by Biological Technology,TP301.6
  20. Wireless Sensor Network of Minimal Set Covering of DNA Algorithms,TP301.6
  21. Designing of DNA Sequence Based on Improvd Genetic Algorithm,TP18

CLC: > Industrial Technology > Automation technology,computer technology > Computing technology,computer technology > General issues > Theories, methods
© 2012 www.DissertationTopic.Net  Mobile