PubMed Health⌕ Search

Biomedical subjects

Paul W K Rothemund

Publications and source records attributed to Paul W K Rothemund.

6 recordsLinked to original sources

Folding DNA to create nanoscale shapes and patterns.

'Bottom-up fabrication', which exploits the intrinsic properties of atoms and molecules to direct their self-organization, is widely used to make relatively simple nanostructures. A key goal for this approach is to create nanostructures of high complexity, matching that routinely achieved by 'top-down' methods. The self-assembly of DNA molecules provides an attractive route towards this goal. Here I describe a simple method for folding long, single-stranded DNA molecules into arbitrary two-dimensional shapes. The design for a desired shape is made by raster-filling the shape with a 7-kilobase single-stranded scaffold and by choosing over 200 short oligonucleotide 'staple strands' to hold the scaffold in place. Once synthesized and mixed, the staple and scaffold strands self-assemble in a single step. The resulting DNA structures are roughly 100 nm in diameter and approximate desired shapes such as squares, disks and five-pointed stars with a spatial resolution of 6 nm. Because each oligonucleotide can serve as a 6-nm pixel, the structures can be programmed to bear complex patterns such as words and images on their surfaces. Finally, individual DNA structures can be programmed to form larger assemblies, including extended periodic lattices and a hexamer of triangles (which constitutes a 30-megadalton molecular complex).

Art↗

Sturdier DNA nanotubes via ligation.

DNA nanotubes are crystalline self-assemblies of DNA tiles approximately 10 nm in diameter that readily grow tens of micrometers in length. Easy assembly, programmability, and stiffness make them interesting for many applications, but DNA nanotubes begin to melt at temperatures below 40 degrees C, break open when deposited on mica or scanned by AFM, and disintegrate in deionized water. These weaknesses can be traced to the presence of discontinuities in the phosphate backbone, called nicks. The nanotubes studied here have five nicks, one in the core of a tile and one at each corner. We report the successful ligation of all four corner nicks by T4 DNA ligase. Although ligation does not change the nanotubes' stiffness, ligated nanotubes withstand temperatures over 70 degrees C, resist breaking during AFM, and are stable in pure water for over a month. Ligated DNA nanotubes are thus physically and chemically sturdy enough to withstand the manipulations necessary for many technological applications.

Aluminum Silicates↗

Two computational primitives for algorithmic self-assembly: copying and counting.

Copying and counting are useful primitive operations for computation and construction. We have made DNA crystals that copy and crystals that count as they grow. For counting, 16 oligonucleotides assemble into four DNA Wang tiles that subsequently crystallize on a polymeric nucleating scaffold strand, arranging themselves in a binary counting pattern that could serve as a template for a molecular electronic demultiplexing circuit. Although the yield of counting crystals is low, and per-tile error rates in such crystals is roughly 10%, this work demonstrates the potential of algorithmic self-assembly to create complex nanoscale patterns of technological interest. A subset of the tiles for counting form information-bearing DNA tubes that copy bit strings from layer to layer along their length.

Algorithms↗

Design and characterization of programmable DNA nanotubes.

DNA self-assembly provides a programmable bottom-up approach for the synthesis of complex structures from nanoscale components. Although nanotubes are a fundamental form encountered in tile-based DNA self-assembly, the factors governing tube structure remain poorly understood. Here we report and characterize a new type of nanotube made from DNA double-crossover molecules (DAE-E tiles). Unmodified tubes range from 7 to 20 nm in diameter (4 to 10 tiles in circumference), grow as long as 50 microm with a persistence length of approximately 4 microm, and can be programmed to display a variety of patterns. A survey of modifications (1) confirms the importance of sticky-end stacking, (2) confirms the identity of the inside and outside faces of the tubes, and (3) identifies features of the tiles that profoundly affect the size and morphology of the tubes. Supported by these results, nanotube structure is explained by a simple model based on the geometry and energetics of B-form DNA.

DNA↗

Algorithmic self-assembly of DNA Sierpinski triangles.

Algorithms and information, fundamental to technological and biological organization, are also an essential aspect of many elementary physical phenomena, such as molecular self-assembly. Here we report the molecular realization, using two-dimensional self-assembly of DNA tiles, of a cellular automaton whose update rule computes the binary function XOR and thus fabricates a fractal pattern--a Sierpinski triangle--as it grows. To achieve this, abstract tiles were translated into DNA tiles based on double-crossover motifs. Serving as input for the computation, long single-stranded DNA molecules were used to nucleate growth of tiles into algorithmic crystals. For both of two independent molecular realizations, atomic force microscopy revealed recognizable Sierpinski triangles containing 100-200 correct tiles. Error rates during assembly appear to range from 1% to 10%. Although imperfect, the growth of Sierpinski triangles demonstrates all the necessary mechanisms for the molecular implementation of arbitrary cellular automata. This shows that engineered DNA self-assembly can be treated as a Turing-universal biomolecular system, capable of implementing any desired algorithm for computation or construction tasks.

Algorithms↗

Solution of a 20-variable 3-SAT problem on a DNA computer.

A 20-variable instance of the NP-complete three-satisfiability (3-SAT) problem was solved on a simple DNA computer. The unique answer was found after an exhaustive search of more than 1 million (2(20)) possibilities. This computational problem may be the largest yet solved by nonelectronic means. Problems of this size appear to be beyond the normal range of unaided human computation.

Base Pairing↗