Dissertation > Excellent graduate degree dissertation topics show

Research on DNA Algorithm of 0-1 Programming Problem

Author: LiuLiZuo
Tutor: GuoPing
School: Chongqing University
Course: Applied Computer Technology
Keywords: DNA computing 0-1 programming problem surface based integer coefficient
CLC: TP301.6
Type: Master's thesis
Year: 2009
Downloads: 140
Quote: 1
Read: Download Dissertation

Abstract


In 1994, Adleman issued a paper on "Science" which solved Directed Hamilton Path Problem by means of DNA molecular and opened up a new discipline named DNA computing. DNA computing represents a brand new field for solving NP-complete problem from biology perspective. As an important problem in operational research, 0-1 programming problem is a hotspot in DNA computing research.This dissertation mostly studies the DNA algorithm of 0-1 programming problem which coefficient is integer. The main contents and results of this dissertation are as follows:①Explore the background, research state, and basic knowledge of DNA computing, and analyze the current issue of DNA algorithm of 0-1 programming problem.②Study and design DNA algorithm of 0-1 programming problem which coefficient is integer. Propose the surface based DNA algorithmⅠ,Ⅱ,Ⅲof 0-1 programming problem, and algorithmⅡ,Ⅲapply DNA computing on 0-1 programming problem which coefficient is integer directly.③Represent the instance verification of algorithmⅠ,Ⅱ,Ⅲ, and make comparison of algorithmⅠ,Ⅱ,Ⅲ.④Study the simulation of DNA computing, and design and implement the simulation of the algorithmⅢ, which verifies the validity and feasibility of algorithmⅢ.In this dissertation, three kinds of the DNA algorithms of 0-1 programming problem which coefficient is integer are given out, which enrich and boarden the DNA algorithms of 0-1 programming problem. DNA algorithm of 0-1 programming problem which coefficient is integer is meaningful for sloving lots of classical problems in reality.

Related Dissertations

  1. Hybrid DNA Genetic Algorithm and Its Application in the MTSP Problem,TP18
  2. Research on Combinatorial Optimization Problem Based on DNA Self-Assemble,TP399-C8
  3. Maximum Matching Problem of DNA Algorithms Rearch,TP301.6
  4. The Research on Time-spatial Distribution of Precipitable Water in Taklimakan Desert,P426
  5. Coevolutionary Binary Ant Colony Algorithm,TP301.6
  6. Design and Research of the data structure in DNA computer,TP311.12
  7. The Research on Several Problems of DNA Computing,TP301
  8. Global Method for Stability Analysis of Slopes Based on Pan’s Maximum Principle,TU43
  9. Smoothing Newton Method for Nonlinear Programming Problem and SQP-Filter Method for Constrained Minimax Problem,O221.2
  10. A Nonmonotone Smoothing Newton Algorithm for Solving Zero-one Nonlinear Integer Programming Problems,O221.4
  11. Smoothing of Penalty Function,O221.2
  12. Study on Some Theories of DNA Computing,TP301.6
  13. The Design and Implementation of DNA Computing Model Based on 0-1 Programming,TP3
  14. The GA in the DNA Computing of the Research and Application,TP18
  15. The Application of DNA Computation in Information Security,TP309
  16. The Coding Sequence of DNA Computing and Algorithm Theory,O157.4
  17. DNA Computing in Graph Theory,O157.5
  18. The Research of DNA Algorithm for a Class of Domination in Graph,O157.5
  19. Analysis of AutoCAD Architectural Engineering Design Plan,TU201.4
  20. Multi-States Biomolecular Autonomous Computer Applying in Leukaemia,TP301.1

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