The DOI matches its Crossref record.
Making DNA Add
Abstract
Recent studies have demonstrated the feasibility of using DNA-based experiments to compute solutions to combinatorial problems. However, a prerequisite for designing a computer useful in a wide range of applications is the ability to perform mathematical calculations. The development of a DNA-based algorithm for addition is presented. The DNA representation of two nonnegative binary numbers is presented in a form permitting a chain of primer extension reactions to carry out the addition operation. To demonstrate the feasibility of this algorithm, a simple example was executed biochemically.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
de Silva, A. P., & McClenaghan, N. D. (2004) · Chemistry – A European Journal · doi:10.1002/chem.200305054 · Cited by 612
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
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
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
Siegel, R. W., Hu, E., Cox, D. M., Goronkin, H., Jelinski, L., Koch, C. C., Mendel, J., Roco, M. C., & Shaw, D. T. (1999) · Springer eBooks · doi:10.1007/978-94-015-9185-0 · Cited by 380
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
Fundamentals of natural computing: an overview
DECASTRO, L. (2007) · Physics of Life Reviews · doi:10.1016/j.plrev.2006.10.002 · Cited by 297
Cryptography with DNA binary strands
Leier, A., Richter, C., Banzhaf, W., & Rauhe, H. (2000) · Biosystems · doi:10.1016/s0303-2647(00)00083-6 · Cited by 285
Gehani, A., LaBean, T., & Reif, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24635-0_12 · Cited by 255
Binary DNA Nanostructures for Data Encryption
Halvorsen, K., & Wong, W. P. (2012) · PLoS ONE · doi:10.1371/journal.pone.0044212 · Cited by 45
Metadata
- Authors
- Guarnieri, F., Fliss, M., & Bancroft, C.
- Venue
- Science
- Published
- 1996-07-12
- Volume
- 273
- Issue
- 5272
- Pages
- 220-223
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W1985073670
- Cited by
- 189
- References
- 0
- FWCI
- 3.09
- 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
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.