DNA Computing Model of the Integer Linear Programming Problem Based on Molecular Beacon

Biological chip technology and DNA computing are new research areas in biology science and information science separately. The essential characteristic of both is the massive parallel of obtaining and managing information. The integer linear programming problem is an important problem in opsearch and it is an NP-complete problem. But up to now, there does not exist any good algorithm yet. A new DNA computing model is provided to solve a integer linear programming problem based on Molecular Beacon chip. In the method, the integer linear programming problem is solved with molecular beacon by fluorescing upon hybridization to their complementary DNA targets. The method has some significant advantages such as simple encoding, excellent sensitivity, high selectivity, low cost, low error, short operating time, reusable surface and simple experimental steps. The result suggest s the potential of Molecular Beacon used as a DNA computer chip.

[1]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[2]  A. Condon,et al.  Progress toward demonstration of a surface based DNA computation: a one word approach to solve a model satisfiability problem. , 1999, Bio Systems.

[3]  Lloyd M. Smith,et al.  DNA computing on surfaces , 2000, Nature.

[4]  Clifford R. Johnson,et al.  Solution of a 20-Variable 3-SAT Problem on a DNA Computer , 2002, Science.

[5]  K Sakamoto,et al.  Molecular computation by DNA hairpin formation. , 2000, Science.

[6]  Jin Xu,et al.  A Chinese Postman Problem Based on DNA Computing , 2002, J. Chem. Inf. Comput. Sci..

[7]  Weihong Tan,et al.  DESIGNING A NOVEL MOLECULAR BEACON FOR SURFACE-IMMOBILIZED DNA HYBRIDIZATION STUDIES , 1999 .

[8]  Xu Jin,et al.  The general form of 0-1 programming problem based on DNA computing. , 2003, Bio Systems.

[9]  R J Lipton,et al.  DNA solution of hard computational problems. , 1995, Science.

[10]  H Wu.  An improved surface-based method for DNA computation. , 2001, Bio Systems.

[11]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[12]  P D Kaplan,et al.  DNA solution of the maximal clique problem. , 1997, Science.

[13]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[14]  T. Head.  Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. , 1987, Bulletin of mathematical biology.

[15]  Shiying Wang,et al.  DNA solution of integer linear programming , 2005, Appl. Math. Comput..

[16]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[17]  J C Cox,et al.  The complexities of DNA computation. , 1999, Trends in biotechnology.

[18]  D. Bartholomew,et al.  Linear Programming: Methods and Applications , 1970 .

[19]  Shi V. Liu.  Debating controversies can enhance creativity , 2000, Nature.