Research On DNA Algorithm Of 0-1 Programming Problem

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.