Dissertation > Excellent graduate degree dissertation topics show

Several DNA Computing Methods for Minimal Vertex Covering Problems

Author: ZhouJinFeng
Tutor: YinZhiXiang
School: Anhui University of Technology
Course: Applied Mathematics
Keywords: DNA computing the minimal vertex problem surface model molecularbeacon model
CLC: O157.5
Type: Master's thesis
Year: 2013
Downloads: 13
Quote: 0
Read: Download Dissertation

Abstract


Electronic computer can not satisfy people’s needs with more and more complex problems appearing. But DNA computer has large storage and parallel resistance, so it has been widely used to solve some complex problems in recent years. The main idea of DNA computing is that use biological operation to solve some puzzling problems based on the structure of DNA molecular. DNA computing is a new field because it firstly combines the biology and math. The research has certain significance. In recent years, DNA computing has been used to solve some NP-problems in graph theory, such as maximal independent set problem, maximal clique problem, maximal matching problem and the minimal vertex problem.The thesis firstly gives the basic theoretical knowledge of DNA, such as the structure of DNA, the basic operation of DNA molecular, introduces the problem of encoding, the factors of influencing encoding, several common encoding methods. Then the thesis also gives some common DNA computing models including:tube model, surface model and chip model based on biological operation, splicing model, paste model, pals mid model, harping model, molecular beacon model and self-assembly model based the characteristics of the DNA molecular.There are many NP-problems in the graph theory and the combination. The minimal vertex problems are discussed and some DNA models are also introduced in the thesis. Firstly, we convert the minimal vertex problems to0-1problems, which is very important to solve the problem. And then surface model, molecular beacon model and improved chip model are introduced in detail. At last, the summary is given. In a word, the work is to be done.

Related Dissertations

  1. Research on 3D Reconstruction System for RPM Based on Medical Images,TP391.41
  2. Study on Enhanced Treatment of Molasses Alcohol Anaerobic Effluent,X703
  3. Hybrid DNA Genetic Algorithm and Its Application in the MTSP Problem,TP18
  4. Research on Combinatorial Optimization Problem Based on DNA Self-Assemble,TP399-C8
  5. Maximum Matching Problem of DNA Algorithms Rearch,TP301.6
  6. Study on Real-time Screen Space Fluid Rendering,TP391.41
  7. New Open MRI superconducting main magnet design,R318.6
  8. Skid steer loader working device damping system design and research,TH243
  9. Essentially constant surface model class and operation of OPRATIONS,P228.4
  10. Study on Issues Related with True Digital Ortho Map Generation,P23
  11. The Optimization Design of the Wing with Low Detectable Structure,V218
  12. Robust Optimal Design mechanical products,TH122
  13. Design and Research of the data structure in DNA computer,TP311.12
  14. The Research on Several Problems of DNA Computing,TP301
  15. Study on Some Theories of DNA Computing,TP301.6
  16. The Design and Implementation of DNA Computing Model Based on 0-1 Programming,TP3
  17. The GA in the DNA Computing of the Research and Application,TP18
  18. The Study on Visualization Modeling and Analysis of Three-dimensional Stratified Geological Body,TP391.41
  19. The Application of DNA Computation in Information Security,TP309
  20. 0-1 Programming Problem Based on Sticker Model,O221.4
  21. The Coding Sequence of DNA Computing and Algorithm Theory,O157.4

CLC: > Mathematical sciences and chemical > Mathematics > Algebra,number theory, portfolio theory > Combinatorics ( combinatorics ) > Graph Theory
© 2012 www.DissertationTopic.Net  Mobile