The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Solution of a 20-Variable 3-SAT Problem on a DNA Computer
Abstract
A 20-variable instance of the NP-complete three-satisfiability (3-SAT) problem was solved on a simple DNA computer. The unique answer was found after an exhaustive search of more than 1 million (2 20 ) possibilities. This computational problem may be the largest yet solved by nonelectronic means. Problems of this size appear to be beyond the normal range of unaided human computation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Molecular Computation of Solutions to Combinatorial Problems
Adleman, L. M. (1994) · Science · doi:10.1126/science.7973651 · Cited by 4,474
Self-citationDesign and self-assembly of two-dimensional DNA crystals
Winfree, E., Liu, F., Wenzler, L. A., & Seeman, N. C. (1998) · Nature · doi:10.1038/28998 · Cited by 2,857
A DNA-fuelled molecular machine made of DNA
Yurke, B., Turberfield, A. J., Mills, A. P., Simmel, F. C., & Neumann, J. L. (2000) · Nature · doi:10.1038/35020524 · Cited by 2,448
DNA Solution of Hard Computational Problems
Lipton, R. J. (1995) · Science · doi:10.1126/science.7725098 · Cited by 1,057
Logical computation using algorithmic self-assembly of DNA triple-crossover molecules
Mao, C., LaBean, T. H., Reif, J. H., & Seeman, N. C. (2000) · Nature · doi:10.1038/35035038 · Cited by 779
Single-step assembly of a gene and entire plasmid from large numbers of oligodeoxyribonucleotides
Stemmer, W. P. C., Crameri, A., Ha, K. D., Brennan, T. M., & Heyneker, H. L. (1995) · Gene · doi:10.1016/0378-1119(95)00511-4 · Cited by 728
Head, T. (1987) · Bulletin of Mathematical Biology · doi:10.1007/bf02481771 · Cited by 652
Programmable and autonomous computing machine made of biomolecules
Benenson, Y., Paz-Elizur, T., Adar, R., Keinan, E., Livneh, Z., & Shapiro, E. (2001) · Nature · doi:10.1038/35106533 · Cited by 645
DNA Solution of the Maximal Clique Problem
Ouyang, Q., Kaplan, P. D., Liu, S., & Libchaber, A. (1997) · Science · doi:10.1126/science.278.5337.446 · Cited by 624
Liu, Q., Wang, L., Frutos, A. G., Condon, A. E., Corn, R. M., & Smith, L. M. (2000) · Nature · doi:10.1038/35003155 · Cited by 529
Molecular Computation by DNA Hairpin Formation
Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., & Hagiya, M. (2000) · Science · doi:10.1126/science.288.5469.1223 · Cited by 388
Molecular computation: RNA solutions to chess problems
Faulhammer, D., Cukras, A. R., Lipton, R. J., & Landweber, L. F. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.97.4.1385 · Cited by 338
A Sticker-Based Model for DNA Computation
ROWEIS, S., WINFREE, E., BURGOYNE, R., CHELYAPOV, N. V., GOODMAN, M. F., ROTHEMUND, P. W. K., & ADLEMAN, L. M. (1998) · Journal of Computational Biology · doi:10.1089/cmb.1998.5.615 · Cited by 218
Self-citationGuarnieri, F., Fliss, M., & Bancroft, C. (1996) · Science · doi:10.1126/science.273.5272.220 · Cited by 189
Building an Associative Memory Vastly Larger Than the Brain
Baum, E. B. (1995) · Science · doi:10.1126/science.7725109 · Cited by 168
A DNA and restriction enzyme implementation of Turing machines
Rothemund, P. W. K. (1996) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/027/06 · Cited by 153
Self-citationThe evolution of cellular computing: nature’s solution to a computational problem
Landweber, L. F., & Lila Kari, A. (1999) · Biosystems · doi:10.1016/s0303-2647(99)00027-1 · Cited by 139
Cited by
DNA-Templated Self-Assembly of Protein Arrays and Highly Conductive Nanowires
Yan, H., Park, S. H., Finkelstein, G., Reif, J. H., & LaBean, T. H. (2003) · Science · doi:10.1126/science.1089389 · Cited by 1,762
A fully programmable 100-spin coherent Ising machine with all-to-all connections
McMahon, P. L., Marandi, A., Haribara, Y., Hamerly, R., Langrock, C., Tamate, S., Inagaki, T., Takesue, H., Utsunomiya, S., Aihara, K., et al. (2016) · Science · doi:10.1126/science.aah5178 · Cited by 702
A deoxyribozyme-based molecular automaton
Stojanovic, M. N., & Stefanovic, D. (2003) · Nature Biotechnology · doi:10.1038/nbt862 · Cited by 625
Nucleic Acid Based Molecular Devices
Krishnan, Y., & Simmel, F. C. (2011) · Angewandte Chemie International Edition · doi:10.1002/anie.200907223 · Cited by 572
Advanced sequencing technologies: methods and goals
Shendure, J., Mitra, R. D., Varma, C., & Church, G. M. (2004) · Nature Reviews Genetics · doi:10.1038/nrg1325 · Cited by 558
Metadata
- Authors
- Braich, R. S., Chelyapov, N., Johnson, C., Rothemund, P. W. K., & Adleman, L.
- Venue
- Science
- Published
- 2002-04-19
- Volume
- 296
- Issue
- 5567
- Pages
- 499-502
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2159635590
- Cited by
- 568
- References
- 18
- FWCI
- 12.53
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.