Solution of a Satisfiability Problem on a Gel-Based DNA Computer
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Abstraction layers for scalable microfluidic biocomputing
Natural Computing: an international journal
Modeling non-specific binding in gel-based DNA computers
DNA13'07 Proceedings of the 13th international conference on DNA computing
Abstraction layers for scalable microfluidic biocomputers
DNA'06 Proceedings of the 12th international conference on DNA Computing
Hi-index | 0.00 |
In the decade since the first molecular computation was performed, it has been shown that DNA molecules can perform sophisticated, massively parallel computations avoiding the Von Neumann bottleneck. However, progress in the field has been slow. The largest problem solved to date is an instance of the 20-variable 3-CNF SAT problem. Performing the computation took more than two man-weeks to complete because every aspect of the computation was performed by hand. Molecular computations are extremely labor intensive and error prone–automation is necessary for further progress. The next step, (the second generation DNA computer – that of taking the laborious, laboratory bench protocols performed by hand, and automating them), has been achieved with the construction of an automated DNA computer dubbed EDNAC. It employs the same paradigm that was used to solve the labor-intensive instance of the 20-variable 3-CNF SAT problem. Using a combinatorial DNA library and complementary probes, EDNAC solves instances of the n-variable 3-CNF SAT problem. A 10 variable instance of the 3-CNF SAT problem was essayed. The computation took 28 hours to perform. EDNAC correctly computed nine of the ten variables, with a tenth variable remaining ambiguous. This result is comparable to current results in the molecular computation community. This research tested the critical properties, such as complexity, robustness, reliability, and repeatability necessary for the successful automation of a molecular computer.