A new approach to advance the DNA computing

Abstract It has been evidenced that DNA computing can solve those problems which are currently intractable on even the fastest electronic computers. The algorithm design for DNA computing, however, is not straightforward. Both a significant knowledge of the DNA molecule and a strong background in computer engineering are required to develop efficient DNA computing algorithms. The existing models based on which a few DNA computing algorithms were developed are not sufficiently powerful and robust to attract potential users. In this paper, a new DNA computing model is introduced based on which new algorithms are developed to solve the 3-Coloring problem. These new algorithms are presented as vehicles for demonstrating the advantages of the new model, and they can be expanded to solve other NP-complete problems. Our new algorithms can significantly speed up computation and therefore achieve a better time performance. Furthermore, with the given resource, our algorithms can solve problems of much greater size as compared to existing DNA computing algorithms. In addition, the error rate can be greatly reduced by applying our new algorithms. All of the advantages provided by the new model make DNA computing very efficient and attractive in solving computational intense problems.

[1]  Eric Bach,et al.  DNA models and algorithms for NP-complete problems , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[2]  Guillermo A. Cecchi,et al.  DNA based molecular computation: Template-template interactions in PCR , 1996, DNA Based Computers.

[3]  Qinghua Liu,et al.  A surface-based approach to DNA computation , 1996, DNA Based Computers.

[4]  Z. F. Qiu.  Arithmetic and logic operations for DNA computers , 1998 .

[5]  Leonard M. Adleman,et al.  Solution of a Satisfiability Problem on a Gel-Based DNA Computer , 2000, DNA Computing.

[6]  Erik Winfree,et al.  Universal computation via self-assembly of DNA: Some theory and experiments , 1996, DNA Based Computers.

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

[8]  Lila Kari,et al.  Towards a DNA Solution to the Shortest Common Superstring Problem , 1999, Int. J. Artif. Intell. Tools.

[9]  Leonard M. Adleman,et al.  On constructing a molecular computer , 1995, DNA Based Computers.

[10]  Srinivasan Parthasarathy,et al.  Arithmetic and logic operations with DNA , 1997, DNA Based Computers.

[11]  E. Kay,et al.  Graph Theory. An Algorithmic Approach , 1975 .

[12]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[13]  A. Condon,et al.  Surface-based DNA computing operations: DESTROY and READOUT. , 1999, Bio Systems.

[14]  Erik Winfree,et al.  A Sticker-Based Model for DNA Computation , 1998, J. Comput. Biol..

[15]  John Clark,et al.  A First Look at Graph Theory , 1991 .