In this paper I present a new model that employs a biological (specifically DNA -based) substrate for performing computation. Specifically, I describe strategies for performing parallel function application in the DNA-computing models described by Adelman, Cai et. al., and Liu et. al. Employing only DNA operations which can presently be performed, I discuss some direct algorithms for computing a variety of useful mathematical functions on DNA, culminating in an algorithm for minimizing an arbitrary continuous function. In addition, computing genetic algorithms on a DNA substrate is briefly discussed.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/5942 |
| Date | 01 December 1996 |
| Creators | Blumberg, Andrew Justin |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 14 p., 265794 bytes, 210981 bytes, application/postscript, application/pdf |
| Relation | AIM-1588 |
Page generated in 0.0026 seconds