The DOI matches its Crossref record.
DNA Solution of the Maximal Clique Problem
Abstract
The maximal clique problem has been solved by means of molecular biology techniques. A pool of DNA molecules corresponding to the total ensemble of six-vertex cliques was built, followed by a series of selection processes. The algorithm is highly parallel and has satisfactory fidelity. This work represents further evidence for the ability of DNA computing to solve NP-complete search problems.
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
Cited by
Thermodynamic basis of the enhanced specificity of structured DNA probes
Bonnet, G., Tyagi, S., Libchaber, A., & Kramer, F. R. (1999) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.96.11.6171 · Cited by 658
Self-citationBinary DNA Nanostructures for Data Encryption
Halvorsen, K., & Wong, W. P. (2012) · PLoS ONE · doi:10.1371/journal.pone.0044212 · Cited by 45
Metadata
- Authors
- Ouyang, Q., Kaplan, P. D., Liu, S., & Libchaber, A.
- Venue
- Science
- Published
- 1997-10-17
- Volume
- 278
- Issue
- 5337
- Pages
- 446-449
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2022943108
- Cited by
- 624
- References
- 0
- FWCI
- 5.06
- 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: DNA Solution of the Maximal Clique Problem. https://app.cochat.ai/papers/10.1126/science.278.5337.446
- The paper
- Ouyang, Q., Kaplan, P. D., Liu, S., & Libchaber, A. (1997). DNA Solution of the Maximal Clique Problem. Science. https://doi.org/10.1126/science.278.5337.446
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.
