Automated Design and Programming of a Microfluidic DNA Computer

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. Key words: algorithm, Boolean expression, DNA computing, microfluidics, NP-complete, satisfiability

• Type: Journal
• Year: 2006
• Where: NC
• Authors: Michael S. Livstone, Ron Weiss, Laura F. Landweber
• Keywords: NC 1998, NC 2006, Quadratic Time, Satisfiability Problem, Similar Device