The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
DNA Solution of Hard Computational Problems
Abstract
DNA experiments are proposed to solve the famous "SAT" problem of computer science. This is a special case of a more general method that can solve NP-complete problems. The advantage of these results is the huge parallelism inherent in DNA-based computing. It has the potential to yield vast speedups over conventional electronic-based computers for such search problems.
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
(1979) · Cited by 43,841
Molecular Computation of Solutions to Combinatorial Problems
Adleman, L. M. (1994) · Science · doi:10.1126/science.7973651 · Cited by 4,474
The Synthesis of Two-Terminal Switching Circuits
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb03624.x · Cited by 802
(2004) · Forensic Botany · doi:10.1201/9780203484593-10 · Cited by 787
Cited by
Ensemble quantum computing by NMR spectroscopy
Cory, D. G., Fahmy, A. F., & Havel, T. F. (1997) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.94.5.1634 · Cited by 964
Quantum information processing with superconducting circuits: a review
Wendin, G. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 890
An autonomous molecular computer for logical control of gene expression
Benenson, Y., Gil, B., Ben-Dor, U., Adar, R., & Shapiro, E. (2004) · Nature · doi:10.1038/nature02551 · Cited by 821
Archetypes and the collective unconscious
Lawson, T. T. (2018) · Carl Jung, Darwin of the Mind · doi:10.4324/9780429472701-3 · Cited by 821
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
Nanofluidics: what is it and what can we expect from it?
Eijkel, J. C. T., & Berg, A. V. D. (2005) · Microfluidics and Nanofluidics · doi:10.1007/s10404-004-0012-9 · Cited by 696
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
Nucleic Acid Based Molecular Devices
Krishnan, Y., & Simmel, F. C. (2011) · Angewandte Chemie International Edition · doi:10.1002/anie.200907223 · Cited by 572
Solution of a 20-Variable 3-SAT Problem on a DNA Computer
Braich, R. S., Chelyapov, N., Johnson, C., Rothemund, P. W. K., & Adleman, L. (2002) · Science · doi:10.1126/science.1069528 · Cited by 568
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
Algorithmic Self-Assembly of DNA
Winfree, E. (2006) · 2006 International Conference on Microtechnologies in Medicine and Biology · doi:10.1109/mmb.2006.251471 · Cited by 487
Controlling Motion at the Nanoscale: Rise of the Molecular Machines
Abendroth, J. M., Bushuyev, O. S., Weiss, P. S., & Barrett, C. J. (2015) · ACS Nano · doi:10.1021/acsnano.5b03367 · Cited by 447
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
Biomolecular computing systems: principles, progress and potential
Benenson, Y. (2012) · Nature Reviews Genetics · doi:10.1038/nrg3197 · Cited by 373
Li, J., Green, A. A., Yan, H., & Fan, C. (2017) · Nature Chemistry · doi:10.1038/nchem.2852 · Cited by 353
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
Self-citationCryptography with DNA binary strands
Leier, A., Richter, C., Banzhaf, W., & Rauhe, H. (2000) · Biosystems · doi:10.1016/s0303-2647(00)00083-6 · Cited by 285
DNA molecule provides a computing machine with both data and fuel
Benenson, Y., Adar, R., Paz-Elizur, T., Livneh, Z., & Shapiro, E. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0535624100 · Cited by 255
Emerging Approaches to DNA Data Storage: Challenges and Prospects
Doricchi, A., Platnich, C. M., Gimpel, A., Horn, F., Earle, M., Lanzavecchia, G., Cortajarena, A. L., Liz-Marzán, L. M., Liu, N., Heckel, R., et al. (2022) · ACS Nano · doi:10.1021/acsnano.2c06748 · Cited by 235
Surprising fidelity of template-directed chemical ligation of oligonucleotides
James, K. D., & Ellington, A. D. (1997) · Chemistry & Biology · doi:10.1016/s1074-5521(97)90245-3 · Cited by 50
Binary DNA Nanostructures for Data Encryption
Halvorsen, K., & Wong, W. P. (2012) · PLoS ONE · doi:10.1371/journal.pone.0044212 · Cited by 45
Large-scale DNA memory based on the nested PCR
Yamamoto, M., Kashiwamura, S., Ohuchi, A., & Furukawa, M. (2008) · Natural Computing · doi:10.1007/s11047-008-9076-x · Cited by 33
DNA Memory with 16.8M Addresses
Yamamoto, M., Kashiwamura, S., & Ohuchi, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77962-9_10 · Cited by 4
Metadata
- Authors
- Lipton, R. J.
- Venue
- Science
- Published
- 1995-04-28
- Volume
- 268
- Issue
- 5210
- Pages
- 542-545
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2027603534
- Cited by
- 1,057
- References
- 4
- FWCI
- 6.99
- 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.