Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Abstraction layers for scalable microfluidic biocomputing
Natural Computing: an international journal
A Parallel DNA Algorithm Using a Microfluidic Device to Build Scheduling Grids
IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
A proposed modularized DNA computer, based on biochips
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Abstraction layers for scalable microfluidic biocomputers
DNA'06 Proceedings of the 12th international conference on DNA Computing
Hi-index | 0.00 |
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.