CaltechAUTHORS
  A Caltech Library Service

Two computational primitives for algorithmic self-assembly: Copying and counting

Barish, Robert D. and Rothemund, Paul W. K. and Winfree, Erik (2005) Two computational primitives for algorithmic self-assembly: Copying and counting. Nano Letters, 5 (12). pp. 2586-2592. ISSN 1530-6984. http://resolver.caltech.edu/CaltechAUTHORS:20110309-104201220

[img]
Preview
PDF - Published Version
See Usage Policy.

504Kb
[img]
Preview
PDF - Supplemental Material
See Usage Policy.

583Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20110309-104201220

Abstract

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.


Item Type:Article
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1021/nl052038l DOIUNSPECIFIED
http://pubs.acs.org/doi/abs/10.1021/nl052038lPublisherUNSPECIFIED
Additional Information:© 2005 American Chemical Society. Received October 14, 2005; Revised Manuscript Received October 29, 2005. Publication Date (Web): November 23, 2005. For useful discussions we thank Rebecca Schulman and Deborah Fygenson. We thank the Caltech Molecular Materials Research Center for use of their AFM scanners. R.D.B. was partially supported by a Thomas E. Everhart Caltech Summer Undergraduate Research Fellowship (SURF). P.W.K.R. was supported by a Beckman Fellowship and Moore Center for the Physics of Information postdoctoral fellowship. E.W. acknowledges National Science Foundation awards 0093486 and 0432193.
Funders:
Funding AgencyGrant Number
Caltech Summer Undergraduate Research Fellowship (SURF) Thomas E. Everhart UNSPECIFIED
Beckman Fellowship UNSPECIFIED
Moore Center for the Physics of Information Postdoctoral FellowshipUNSPECIFIED
NSF0093486
NSF0432193
Record Number:CaltechAUTHORS:20110309-104201220
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20110309-104201220
Official Citation:Two Computational Primitives for Algorithmic Self-Assembly:  Copying and Counting Robert D. Barish,Paul W. K. Rothemund, and, and Erik Winfree,, Nano Letters 2005 5 (12), 2586-2592
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:22757
Collection:CaltechAUTHORS
Deposited By: Lucinda Acosta
Deposited On:21 Oct 2011 16:49
Last Modified:26 Dec 2012 13:00

Repository Staff Only: item control page