Diverse and robust molecular algorithms using reprogrammable DNA self-assembly

Damien Woods (), David Doty (), Cameron Myhrvold, Joy Hui, Felix Zhou, Peng Yin and Erik Winfree ()
Additional contact information
Damien Woods: California Institute of Technology
David Doty: California Institute of Technology
Cameron Myhrvold: Harvard University
Joy Hui: California Institute of Technology
Felix Zhou: California Institute of Technology
Peng Yin: Harvard University
Erik Winfree: California Institute of Technology

Nature, 2019, vol. 567, issue 7748, 366-372

Abstract: Abstract Molecular biology provides an inspiring proof-of-principle that chemical systems can store and process information to direct molecular activities such as the fabrication of complex structures from molecular components. To develop information-based chemistry as a technology for programming matter to function in ways not seen in biological systems, it is necessary to understand how molecular interactions can encode and execute algorithms. The self-assembly of relatively simple units into complex products1 is particularly well suited for such investigations. Theory that combines mathematical tiling and statistical–mechanical models of molecular crystallization has shown that algorithmic behaviour can be embedded within molecular self-assembly processes2,3, and this has been experimentally demonstrated using DNA nanotechnology4 with up to 22 tile types5–11. However, many information technologies exhibit a complexity threshold—such as the minimum transistor count needed for a general-purpose computer—beyond which the power of a reprogrammable system increases qualitatively, and it has been unclear whether the biophysics of DNA self-assembly allows that threshold to be exceeded. Here we report the design and experimental validation of a DNA tile set that contains 355 single-stranded tiles and can, through simple tile selection, be reprogrammed to implement a wide variety of 6-bit algorithms. We use this set to construct 21 circuits that execute algorithms including copying, sorting, recognizing palindromes and multiples of 3, random walking, obtaining an unbiased choice from a biased random source, electing a leader, simulating cellular automata, generating deterministic and randomized patterns, and counting to 63, with an overall per-tile error rate of less than 1 in 3,000. These findings suggest that molecular self-assembly could be a reliable algorithmic component within programmable chemical systems. The development of molecular machines that are reprogrammable—at a high level of abstraction and thus without requiring knowledge of the underlying physics—will establish a creative space in which molecular programmers can flourish.

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://www.nature.com/articles/s41586-019-1014-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:nat:nature:v:567:y:2019:i:7748:d:10.1038_s41586-019-1014-9

Ordering information: This journal article can be ordered from
https://www.nature.com/

DOI: 10.1038/s41586-019-1014-9

Access Statistics for this article

Nature is currently edited by Magdalena Skipper

More articles in Nature from Nature
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().