The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Molecular Computation by DNA Hairpin Formation
Abstract
Hairpin formation by single-stranded DNA molecules was exploited in a DNA-based computation in order to explore the feasibility of autonomous molecular computing. An instance of the satisfiability problem, a famous hard combinatorial problem, was solved by using molecular biology techniques. The satisfiability of a given Boolean formula was examined autonomously, on the basis of hairpin formation by the molecules that represent the formula. This computation algorithm can test several clauses in the given formula simultaneously, which could reduce the number of laboratory steps required for computation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Molecular Computation of Solutions to Combinatorial Problems
Adleman, L. M. (1994) · Science · doi:10.1126/science.7973651 · Cited by 4,474
Design 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
The thermodynamics of computation—a review
Bennett, C. H. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02084158 · Cited by 2,006
Predicting DNA duplex stability from the base sequence
Breslauer, K. J., Frank, R., Blöcker, H., & Marky, L. A. (1986) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.83.11.3746 · Cited by 1,837
DNA Solution of Hard Computational Problems
Lipton, R. J. (1995) · Science · doi:10.1126/science.7725098 · Cited by 1,057
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
Păun, G., Rozenberg, G., & Salomaa, A. (1998) · Springer eBooks · doi:10.1007/978-3-662-03563-4 · Cited by 422
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
On the computational power of DNA annealing and ligation
Winfree, E. (1996) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/027/09 · Cited by 197
Cited by
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
Nucleic Acid Based Molecular Devices
Krishnan, Y., & Simmel, F. C. (2011) · Angewandte Chemie International Edition · doi:10.1002/anie.200907223 · Cited by 572
Li, J., Green, A. A., Yan, H., & Fan, C. (2017) · Nature Chemistry · doi:10.1038/nchem.2852 · Cited by 353
Balzani, V., Credi, A., & Venturi, M. (2003) · ChemPhysChem · doi:10.1002/cphc.200390007 · Cited by 268
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
Metadata
- Authors
- Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., & Hagiya, M.
- Venue
- Science
- Published
- 2000-05-19
- Volume
- 288
- Issue
- 5469
- Pages
- 1223-1226
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2086434437
- Cited by
- 388
- References
- 15
- FWCI
- 6.87
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Molecular Computation by DNA Hairpin Formation. https://app.cochat.ai/papers/10.1126/science.288.5469.1223
- The paper
- Sakamoto, K., Gouzu, H., Komiya, K., Kiga, D., Yokoyama, S., Yokomori, T., & Hagiya, M. (2000). Molecular Computation by DNA Hairpin Formation. Science. https://doi.org/10.1126/science.288.5469.1223
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.
