A Clause String DNA Algorithm for SAT
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Stochastic Local Search Algorithms for DNA Word Design
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Algorithms for Testing That Sets of DNA Words Concatenate without Secondary Structure
DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing
Fast Parallel Molecular Solution for DNA-Based Computing: The 0-1 Knapsack Problem
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Using sticker model of DNA computing to solve domatic partition, kernel and induced path problems
Information Sciences: an International Journal
Fast parallel DNA-based algorithms for molecular computation: discrete logarithm
The Journal of Supercomputing
DNA'05 Proceedings of the 11th international conference on DNA Computing
Automating the DNA computer: solving n-variable 3-SAT problems
DNA'06 Proceedings of the 12th international conference on DNA Computing
Research on the counting problem based on linear constructions for DNA coding
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Deterministic polynomial-time algorithms for designing short DNA words
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
DNA'04 Proceedings of the 10th international conference on DNA computing
DNA and Membrane Algorithms for SAT
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
Deterministic polynomial-time algorithms for designing short DNA words
Theoretical Computer Science
A Molecular Solution to the Three-Partition Problem
Journal of Information Technology Research
| Hi-index | 0.00 |
We have succeeded in solving an instance of a 6-variable 11- clause 3-SAT problem on a gel-based DNA computer. Separations were performed using probes covalently bound to polyacrylamide gel. During the entire computation, DNA was retained within a single gel and moved via electrophoresis. The methods used appear to be readily automatable and should be suitable for problems of a significantly larger size.