Dissertation > Excellent graduate degree dissertation topics show

Maximum Matching Problem of DNA Algorithms Rearch

Author: SongChenYang
Tutor: WuXue
School: East China University of Science and Technology
Course: Signal and Information Processing
Keywords: DNA computing Maximum matching problem Sticker-model
CLC: TP301.6
Type: Master's thesis
Year: 2012
Downloads: 75
Quote: 0
Read: Download Dissertation

Abstract


DNA computing has been a touchy point for research in mathematics, biology, chemistry, and computer science in recent years. The DNA computing is a new method that simulates the structure DNA of biology molecule and does the computing by molecule biological technology. Its goal is to produce a new generation computer which takes the DNA computing model as the background and has the magnanimous memory genetic code and the extremely quick running rate. The basic theory of DNA computing is:Encode information using the special structure of DNA double helix and nucleotides match rule, and mapping the object to operating to DNA molecules strands, and build a data pool, then use the rules appointed mapping the DNA molecules strands to a high speed parallel data computing bio-chemistry procedure. It has inestimable superiority in solving in the massively parallel estimation problem. Current DNA computing models include the sticker-model, plasmid-model and double-stranded DNA model.The Maximum Matching Problem (MMP) is a classic combination and optimization problem in graph theory, widely used in wireless network planning, network routing, communication network construction, best planning, and other real applications. In recent years, some researchers have proposed some DNA algorithm to solve MMP, such as plasmid-model and surface-model to solve MMP and sticker-model to solve perfect matching problem. In this paper, we will give a new DNA algorithm to solve MMP in arbitrary graph and propose how to solve the problem of movement-assisted deployment by this algorithm.The innovation of this paper is to solve MMP in arbitrary graph by applying biotechnology-based DNA algorithm. And the new algorithm solves the problem of movement-assisted deployment in wireless sensor networks. The DNA algorithm provides a new programming idea for our study. DNA parallel computing capability has a broad outlook for application.

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. Study on Some Theories of DNA Computing,TP301
  14. Study on Some Methods of DNA Sequence Design in DNA Computing,TP399-C8
  15. Research on Encryption Scheme Based on DNA Technology,TN918.4
  16. Research on Optimization Method of DNA Sequence Design in DNA Computing,TP301.6
  17. Research Basic Operations in DNA Computing,TP38
  18. Using DNA length coding to achieve molecular computing,Q523
  19. Research of Welding Robot Path Planning Algorithm,TP242
  20. DNA Linear Self-Assembly and the Theory of Its Equilibrium,Q523
  21. A General DNA Computing Model for Resolving the Classification Problem of the Nerve Network,TP183

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