The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the computational power of DNA annealing and ligation
Abstract
In [20] it was shown that the DNA primitives of Separate, \nMerge, and Amplify were not sufficiently powerful to invert \nfunctions defined by circuits in linear time. Dan Boneh et \nal [4] show that the addition of a ligation primitive, Append, provides the missing power. The question becomes, "How powerful is ligation? Are Separate, Merge, and Amplify \nnecessary at all?" This paper proposes to informally explore \nthe power of annealing and ligation for DNA computation. \nWe conclude, in fact, that annealing and ligation alone are \ntheoretically capable of universal 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
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
Cited by
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
Self-citationLogical 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
Design and Characterization of Programmable DNA Nanotubes
Rothemund, P. W. K., Ekani-Nkodo, A., Papadakis, N., Kumar, A., Fygenson, D. K., & Winfree, E. (2004) · Journal of the American Chemical Society · doi:10.1021/ja044319l · Cited by 512
Self-citationEmulating biology: Building nanostructures from the bottom up
Seeman, N. C., & Belcher, A. M. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.221458298 · Cited by 419
DNA NANOTECHNOLOGY: Novel DNA Constructions
Seeman, N. C. (1998) · Annual Review of Biophysics and Biomolecular Structure · doi:10.1146/annurev.biophys.27.1.225 · Cited by 398
Metadata
- Authors
- Winfree, E.
- Venue
- DIMACS Series in Discrete Mathematics and Theoretical Computer Science
- Publisher
- American Mathematical Society
- Published
- 1996-07-30
- Pages
- 199-221
- ISSN
- 1052-1798 (ISSN-L)
- 2472-4793
- OpenAlex
- W1486061410
- Cited by
- 197
- References
- 1
- FWCI
- 7.74
- Type
- book chapter
- 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: On the computational power of DNA annealing and ligation. https://app.cochat.ai/papers/10.1090/dimacs/027/09
- The paper
- Winfree, E. (1996). On the computational power of DNA annealing and ligation. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. https://doi.org/10.1090/dimacs/027/09
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.
