The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
A Sticker-Based Model for DNA Computation
Abstract
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which information is represented and of separation by hybridization as a central mechanism. However, unlike previous models, the stickers model has a random access memory that requires no strand extension and uses no enzymes; also (at least in theory), its materials are reusable. The paper describes computation under the stickers model and discusses possible means for physically implementing each operation. Finally, we go on to propose a specific machine architecture for implementing the stickers model as a microprocessor-controlled parallel robotic workstation. In the course of this development a number of previous general concerns about molecular computation (Smith, 1996; Hartmanis, 1995; Linial et al., 1995) are addressed. First, it is clear that general-purpose algorithms can be implemented by DNA-based computers, potentially solving a wide class of search problems. Second, we find that there are challenging problems, for which only modest volumes of DNA should suffice. Third, we demonstrate that the formation and breaking of covalent bonds is not intrinsic to DNA-based computation. Fourth, we show that a single essential biotechnology, sequence-specific separation, suffices for constructing a general-purpose molecular computer. Concerns about errors in this separation operation and means to reduce them are addressed elsewhere (Karp et al., 1995; Roweis and Winfree, 1999). Despite these encouraging theoretical advances, we emphasize that substantial engineering challenges remain at almost all stages and that the ultimate success or failure of DNA computing will certainly depend on whether these challenges can be met in laboratory investigations.
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
Sequence-Selective Recognition of DNA by Strand Displacement with a Thymine-Substituted Polyamide
Nielsen, P. E., Egholm, M., Berg, R. H., & Buchardt, O. (1991) · Science · doi:10.1126/science.1962210 · Cited by 3,332
PNA hybridizes to complementary oligonucleotides obeying the Watson–Crick hydrogen-bonding rules
Egholm, M., Buchardt, O., Christensen, L., Behrens, C., Freier, S. M., Driver, D. A., Berg, R. H., Kim, S. K., Norden, B., & Nielsen, P. E. (1993) · Nature · doi:10.1038/365566a0 · Cited by 2,079
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
Cited by
Solution of a 20-Variable 3-SAT Problem on a DNA Computer
Braich, R. S., Chelyapov, N., Johnson, C., Rothemund, P. W. K., & Adleman, L. (2002) · Science · doi:10.1126/science.1069528 · Cited by 568
Self-citationFundamentals of natural computing: an overview
DECASTRO, L. (2007) · Physics of Life Reviews · doi:10.1016/j.plrev.2006.10.002 · Cited by 297
Binary DNA Nanostructures for Data Encryption
Halvorsen, K., & Wong, W. P. (2012) · PLoS ONE · doi:10.1371/journal.pone.0044212 · Cited by 45
A DNA Computation-Based Image Encryption Scheme for Cloud CCTV Systems
Wu, T.-Y., Fan, X., Wang, K.-H., Lai, C.-F., Xiong, N., & Wu, J. M.-T. (2019) · IEEE Access · doi:10.1109/access.2019.2946890 · Cited by 23
Metadata
- Authors
- ROWEIS, S., WINFREE, E., BURGOYNE, R., CHELYAPOV, N. V., GOODMAN, M. F., ROTHEMUND, P. W. K., & ADLEMAN, L. M.
- Venue
- Journal of Computational Biology
- Publisher
- SAGE Publications
- Published
- 1998-01
- Volume
- 5
- Issue
- 4
- Pages
- 615-629
- ISSN
- 1066-5277 (ISSN-L)
- 1557-8666
- OpenAlex
- W2044131499
- Cited by
- 218
- References
- 3
- FWCI
- 1.91
- 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: A Sticker-Based Model for DNA Computation. https://app.cochat.ai/papers/10.1089/cmb.1998.5.615
- The paper
- ROWEIS, S., WINFREE, E., BURGOYNE, R., CHELYAPOV, N. V., GOODMAN, M. F., ROTHEMUND, P. W. K., & ADLEMAN, L. M. (1998). A Sticker-Based Model for DNA Computation. Journal of Computational Biology. https://doi.org/10.1089/cmb.1998.5.615
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.