As the fabrication of integrated circuits continues to take place on increasingly smaller scales, we grow closer to several fundamental limitations on electronic computers. For many classes of problems, computing devices based on biochemical reactions present an attractive alternative to conventional computing paradigms. We present here a survey of the theory and implementation of biologically ...

The objectives of this chapter are twofold: firstly to introduce DNA computation, and secondly to demonstrate how DNA computing can be applied to solve large, complex combinatorial problems, such as the optimal scheduling of a group of elevators servicing a number of floors in a multi-storey building. Recently, molecular (or wet) computing has been widely researched not only within the context ...

Information and algorithms appear to be central to biological organization and processes, from the storage and reproduction of genetic information to the control of developmental processes to the sophisticated computations performed by the nervous system. Much as human technology uses electronic microprocessors to control electro-mechanical devices, biological organisms use biochemical circuits...

A novel method to encrypt data by applying DNA based computing technology is discussed. Binary data may be encoded in DNA strands by use of an alphabet of short oligonucleotide sequence. The encryption of natural DNA and the encryption of DNA encoding binary data are discussed.A pure XOR based DNA computing scheme is also discussed and the limitations of the proposed scheme are observed. Index ...

DNA computing aims at using nucleic acids for computing. Since micromolar DNA solutions can act as billions of parallel nanoprocessors, DNA computers can in theory solve optimization problems that require vast search spaces. However, the actual parallelism currently being achieved is at least a hundred million-fold lower than the number of DNA molecules used. This is due to the quantity of DNA ...

DNA computing is the method for computation by using DNA and its chemical reactions. Adleman and Lipton have shown that an instance of NP-complete problems can be solved by DNA computing [1, 2]. Their methods first generate all candidate solutions in parallel, and then extract target DNAs by some chemical operations. However, such a simple approach to combinatorial problems will be unpromising,...