DNA computing and its application

Abstract

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 of solving NP-complete/NP-hard problems -which are the most difficult problems in NP -but also implementation by way of digital (silicon-based) computers [23]. We commence with a description of the basic concepts of 'wet computation', then present recent results for the efficient management of a group of elevators. © 2008 Springer-Verlag Berlin Heidelberg.