Location of Repository

The publication of the Adleman experiment in 1994 gave the crucial impetus for many approaches to DNA computing as one possible form of future computing [Adl94]. There is worldwide discussion about chances and limits of this model for computation that focus on implementations and also important theoretical considerations about 'Calculating inside the reaction tube'. Practical approaches of DNA computing are considered particularly interesting, so to say solutions of NP-problems in the laboratory, from which theoretical models can be derived. A certain NP-problem was solved in the laboratory by an interdisciplinar researching group at the University of Technology Dresden, Germany. We are grateful to H.K. Schackert, M. Hauses, and O.N. Koufaki for their help and support to establish the lab-implementation of the algorithm. Here, we show how to describe the algorithm of the NP-problem in this language and how to implement it in the laboratory. All functions of the language DNA-Haskell are executed by lab-experiments. We argue which efficient possibilities exist in the molecular biology to solve mathematical problems, especially NP-problems. The theory of complexity is used to evaluate solutions of the laboratory and the model. (orig.)SIGLEAvailable from TIB Hannover: RR 7739(FI99-02) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman

Topics:
09H - Computer software, programming, 12B - Statistics, operations research, DNA COMPUTING, POLYMERASE CHAIN REACTION, MODEL DEVELOPMENT, NP PROBLEMS, INTEGER KNAPSACK PROBLEM, DNA HASKELL, COMPLEXITY, IMPLEMENTATION

Year: 1999

OAI identifier:

Provided by:
OpenGrey Repository

Download PDF:To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.