Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2010 Aug;21(4):392-400.
doi: 10.1016/j.copbio.2010.05.003. Epub 2010 Jun 9.

Shaping up nucleic acid computation

Affiliations

Shaping up nucleic acid computation

Xi Chen et al. Curr Opin Biotechnol. 2010 Aug.

Abstract

Nucleic acid-based nanotechnology has always been perceived as novel, but has begun to move from theoretical demonstrations to practical applications. In particular, the large address spaces available to nucleic acids can be exploited to encode algorithms and/or act as circuits and thereby process molecular information. In this review we not only revisit several milestones in the field of nucleic acid-based computation, but also highlight how the prospects for nucleic acid computation go beyond just a large address space. Functional nucleic acid elements (aptamers, ribozymes, and deoxyribozymes) can serve as inputs and outputs to the environment, and can act as logical elements. Into the future, the chemical dynamics of nucleic acids may prove as useful as hybridization for computation.

PubMed Disclaimer

Figures

Figure 1
Figure 1
Adleman’s solution of a Hamiltonian path problem (adapted from [2]). (a) The schematic figure of a 7-city Hamiltonian path problem. Each city is named by a number and color coded. (b) Examples of city strands and path strands, with color-coding as in (a). (c) Ligation of two path strands is facilitated by a city strand as a splint.
Figure 2
Figure 2
Toehold-mediated strand displacement. (a) Schematic figure of toehold-mediated strand displacement. Top panel: slow displacement without toehold. Middle panel: largely irreversible strand displacement. Bottom panel: reversible strand displacement, also called toehold exchange. (b) Reaction pathway for toehold-mediated irreversible strand displacement. Round and triangular ends of the lines represent 5′ and 3′ termini, respectively. Dashed line with arrow indicates toehold binding.
Figure 3
Figure 3
Examples of DNA circuits based on toehold exchange. (a) An AND gate, adapted from [8**]. (b) An entropy driven amplifier, adapted from [12]. Names of strands are shown in blue and names of gate complexes are shown in black. Solid gray lines with arrows indicate the reactants and products of individual reactions. Dashed gray lines with arrows indicate toehold binding.
Figure 4
Figure 4
Deoxyribozyme-based logic gates. (a) Sequence and secondary structure of deoxyribozyme E6. The substrate is shown in red. The substrate-binding and catalytic domains of E6 are shown in orange and black, respectively. The bolded “A” in the substrate denotes the ribonucleotide adjacent to the cleavage site (dashed red line). A schematic representation of this structure is shown in the inset. These schematics represents (b) a single-input YES gate, (c) an AND gate, and (d) a NOT gate. In (b) to (d) the input strands are shown in blue and dark green. The corresponding receptors (input-binding loops) are shown in cyan and light green, respectively.

References

    1. Seeman NC. Nucleic acid junctions and lattices. Journal of Theoretical Biology. 1982;99:237–247. - PubMed
    1. Adleman LM. Molecular computation of solutions to combinatorial problems. Science (New York, NY) 1994;266:1021–4. In this work Adleman demonstrated the solution of a Hamiltonian path problem via DNA hybridization. This paper is widely considered the inaugural article of the field of DNA computing. - PubMed
    1. Rothemund PWK, Papadakis N, Winfree E. Algorithmic self-assembly of DNA Sierpinski triangles. PLoS biology. 2004;2:e424. - PMC - PubMed
    1. Braich RS, et al. Solution of a 20-variable 3-SAT problem on a DNA computer. Science (New York, NY) 2002;296:499–502. - PubMed
    1. Benenson Y, et al. Programmable and autonomous computing machine made of biomolecules. Nature. 2001;414:430–4. - PubMed

Publication types

MeSH terms