The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Molecular computation: RNA solutions to chess problems
Open accessAbstract
We have expanded the field of “DNA computers” to RNA and present a general approach for the solution of satisfiability problems. As an example, we consider a variant of the “Knight problem,” which asks generally what configurations of knights can one place on an n × n chess board such that no knight is attacking any other knight on the board. Using specific ribonuclease digestion to manipulate strands of a 10-bit binary RNA library, we developed a molecular algorithm and applied it to a 3 × 3 chessboard as a 9-bit instance of this problem. Here, the nine spaces on the board correspond to nine “bits” or placeholders in a combinatorial RNA library. We recovered a set of “winning” molecules that describe solutions to this problem.
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 cloning: A laboratory manual
Deininger, P. (1990) · Analytical Biochemistry · doi:10.1016/0003-2697(90)90595-z · Cited by 84,682
Molecular Computation of Solutions to Combinatorial Problems
Adleman, L. M. (1994) · Science · doi:10.1126/science.7973651 · Cited by 4,474
On Finding All Suboptimal Foldings of an RNA Molecule
Zuker, M. (1989) · Science · doi:10.1126/science.2468181 · Cited by 2,005
DNA Solution of Hard Computational Problems
Lipton, R. J. (1995) · Science · doi:10.1126/science.7725098 · Cited by 1,057
Self-citationDNA 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
Meyerhans, A., Vartanian, J.-P., & Wain-Hobson, S. (1990) · Nucleic Acids Research · doi:10.1093/nar/18.7.1687 · Cited by 574
Guarnieri, F., Fliss, M., & Bancroft, C. (1996) · Science · doi:10.1126/science.273.5272.220 · Cited by 189
The Evolution of Molecular Computation
Stemmer, W. P. C. (1995) · Science · doi:10.1126/science.270.5241.1510 · Cited by 36
The fidelity of template-directed oligonucleotide ligation and its relevance to DNA computation
James, K. D., Boles, A. R., Henckel, D., & Ellington, A. D. (1998) · Nucleic Acids Research · doi:10.1093/nar/26.22.5203 · Cited by 31
[2] Producing single-stranded DNA in polymerase chain reaction for direct genomic sequencing
Landweber, L. F., & Kreitman, M. (1993) · Methods in enzymology on CD-ROM/Methods in enzymology · doi:10.1016/0076-6879(93)18004-v · Cited by 9
Self-citation
Cited by
Digital Information Processing in Molecular Systems
Szaciłowski, K. (2008) · Chemical Reviews · doi:10.1021/cr068403q · Cited by 827
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
Engineered riboregulators enable post-transcriptional control of gene expression
Isaacs, F. J., Dwyer, D. J., Ding, C., Pervouchine, D. D., Cantor, C. R., & Collins, J. J. (2004) · Nature Biotechnology · doi:10.1038/nbt986 · Cited by 554
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
Metadata
- Authors
- Faulhammer, D., Cukras, A. R., Lipton, R. J., & Landweber, L. F.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2000-02-15
- Volume
- 97
- Issue
- 4
- Pages
- 1385-1389
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W1989767423
- Cited by
- 338
- References
- 10
- FWCI
- 6.76
- Type
- journal article
- Language
- en
- Open access
- green
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: RNA solutions to chess problems. https://app.cochat.ai/papers/10.1073/pnas.97.4.1385
- The paper
- Faulhammer, D., Cukras, A. R., Lipton, R. J., & Landweber, L. F. (2000). Molecular computation: RNA solutions to chess problems. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.97.4.1385
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.
