Cited by 4,474DNA and Biological ComputingAdvanced biosensing and bioanalysis techniquesComplexity and Algorithms in Graphs

Molecular Computation of Solutions to Combinatorial Problems

Adleman, Leonard M.·1994·Science

Abstract

The tools of molecular biology were used to solve an instance of the directed Hamiltonian path problem. A small graph was encoded in molecules of DNA, and the "operations" of the computation were performed with standard protocols and enzymes. This experiment demonstrates the feasibility of carrying out computations at the molecular level.

Integrity signals

Registry

Crossref · 10.1126/science.7973651

Cites

8 of 8 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The Adleman experiment acted as a proof of concept, but in practice the process was more time- and labor-intensive than a conventional digital approach.

    “The Adleman experiment acted as a proof of concept: in practice, the process was more time- and labor-intensive than a conventional digital approach.”
  • Adleman developed a working prototype for a DNA computer in 1994, using a separation-based approach to calculate a Hamiltonian path in a graph with seven summits.

    “A working prototype for a DNA computer was developed by Adleman in 1994,136 wherein he used a separation-based approach to calculate a Hamiltonian path in a graph with seven summits.”
  • More advanced applications, such as random number generation or arithmetic operations, prove the versatility of DNA as an information medium.

    “More advanced applications, for example, random number generation or the possibility to perform arithmetic operations, prove the versatility of DNA as an information medium.[11,12]”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Adleman, L. M.
Affiliations
University of Southern California (US)
Corresponding author
Adleman, Leonard M.
Venue
Science
Published
1994-11-11
Volume
266
Issue
5187
Pages
1021-1024
ISSN
  • 0036-8075 (ISSN-L)
  • 1095-9203
OpenAlex
W1977312644
Cited by
4,474
References
8
Citations by year
2026: 68 · 2025: 123 · 2024: 124 · 2023: 165 · 2022: 163 · 2021: 194 · 2020: 135 · 2019: 160 · 2018: 164 · 2017: 157 · 2016: 154 · 2015: 174 · 2014: 165 · 2013: 205 · 2012: 194
FWCI
13.12
Type
journal article
Language
en
Open access
closed
Locations
  • Science (publishedVersion)
  • PubMed (publishedVersion)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › DNA and Biological Computing
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Advanced biosensing and bioanalysis techniques
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
Keywords
DNA computing, molecular computing, combinatorial optimization, molecular tools
MeSH terms
Algorithms, Base Sequence, DNA, Mathematical Computing, Molecular Sequence Data, Oligodeoxyribonucleotides, Polymerase Chain Reaction

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