Abstract
This paper presents a DNA algorithm which adds two nonnegative binary integers using self-assembly in constant steps. The approach has the benefit of greater experimental simplicity when compared with previous DNA addition algorithms. For the addition of two binary n-bit integers, O(n) is different from DNA strands and only O(1) biochemical experimental procedures are required.
| Original language | English |
|---|---|
| Pages (from-to) | 1462-1467 |
| Number of pages | 6 |
| Journal | Chinese Science Bulletin |
| Volume | 52 |
| Issue number | 11 |
| DOIs | |
| State | Published - Jun 2007 |
| Externally published | Yes |
Keywords
- Addition
- Computing
- DNA
- Self-assembly
Fingerprint
Dive into the research topics of 'DNA addition using linear self-assembly'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver