Previously, we described ways to implement the functions AND and OR in a DNA computer consisting of microreactors with attached heating elements that control annealing of DNA. Based on these findings, we have devised a similar device that can solve a satisfiability problem in any form. The device occupies linear space and operates in quadratic time, while a previously described competing device is built in quadratic space and operates in quadratic time or greater. Reducing the number of reactors in a DNA computer reduces the loss of DNA through binding to the surfaces of the system.
Keywordsalgorithm Boolean expression DNA computing microfluidics NP-complete satisfiability
Unable to display preview. Download preview PDF.
- Faulhammer, D, Cukras, AR, Lipton, RJ, Landweber, LF 2000Molecular computation: RNA solutions to chess problemsProceedings of the National Academic of Science (USA)9713851389Google Scholar
- Garey, MR, Johnson, DS 1979Computers and Intractability: A Guide to the Theory of NP-CompletenessFreemanNew YorkGoogle Scholar
- Kuntzmann, J 1967Fundamental Boolean AlgebraBlackieLondon, GlasgowGoogle Scholar
- Lipton, RJ 1995DNA solution of hard computational problemsScience268542545Google Scholar
- Livstone, MS, Landweber, LF 2003
Mathematical considerations in the design of microreactor-based DNA computersChen, JReif, J eds. 9th International Workshop on DNA-Based Computers, DNA9Springer-VerlagMadison, Wisconsin, USA180189Google Scholar
- Noort, D, Tang, Z, Landweber, LF 2004Fully Controllable Microfluidics for Molecular ComputersJ. Association Laboratory Automation (JALA)9285290Google Scholar