The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
An information-bearing seed for nucleating algorithmic self-assembly
Open accessAbstract
Self-assembly creates natural mineral, chemical, and biological structures of great complexity. Often, the same starting materials have the potential to form an infinite variety of distinct structures; information in a seed molecule can determine which form is grown as well as where and when. These phenomena can be exploited to program the growth of complex supramolecular structures, as demonstrated by the algorithmic self-assembly of DNA tiles. However, the lack of effective seeds has limited the reliability and yield of algorithmic crystals. Here, we present a programmable DNA origami seed that can display up to 32 distinct binding sites and demonstrate the use of seeds to nucleate three types of algorithmic crystals. In the simplest case, the starting materials are a set of tiles that can form crystalline ribbons of any width; the seed directs assembly of a chosen width with >90% yield. Increased structural diversity is obtained by using tiles that copy a binary string from layer to layer; the seed specifies the initial string and triggers growth under near-optimal conditions where the bit copying error rate is <0.2%. Increased structural complexity is achieved by using tiles that generate a binary counting pattern; the seed specifies the initial value for the counter. Self-assembly proceeds in a one-pot annealing reaction involving up to 300 DNA strands containing >17 kb of sequence information. In sum, this work demonstrates how DNA origami seeds enable the easy, high-yield, low-error-rate growth of algorithmic crystals as a route toward programmable bottom-up fabrication.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
Folding DNA to create nanoscale shapes and patterns
Rothemund, P. W. K. (2006) · Nature · doi:10.1038/nature04586 · Cited by 7,354
Self-citationTheory of Self-Reproducing Automata
Schwartz, J. T., von Neumann, J., & Burks, A. W. (1967) · Mathematics of Computation · doi:10.2307/2005041 · Cited by 5,422
THE GROWTH OF BACTERIAL CULTURES
Monod, J. (1949) · Annual Review of Microbiology · doi:10.1146/annurev.mi.03.100149.002103 · Cited by 3,707
Design and self-assembly of two-dimensional DNA crystals
Winfree, E., Liu, F., Wenzler, L. A., & Seeman, N. C. (1998) · Nature · doi:10.1038/28998 · Cited by 2,857
Self-citationThe Algorithmic Beauty of Plants
Prusinkiewicz, P., & Lindenmayer, A. (1990) · The Virtual Laboratory · doi:10.1007/978-1-4613-8476-2 · Cited by 2,823
Nucleic acid junctions and lattices
Seeman, N. C. (1982) · Journal of Theoretical Biology · doi:10.1016/0022-5193(82)90002-9 · Cited by 2,497
DNA-Templated Self-Assembly of Protein Arrays and Highly Conductive Nanowires
Yan, H., Park, S. H., Finkelstein, G., Reif, J. H., & LaBean, T. H. (2003) · Science · doi:10.1126/science.1089389 · Cited by 1,762
Control of Thickness and Orientation of Solution-Grown Silicon Nanowires
Holmes, J. D., Johnston, K. P., Doty, R. C., & Korgel, B. A. (2000) · Science · doi:10.1126/science.287.5457.1471 · Cited by 1,540
Proving Theorems by Pattern Recognition - II
Wang, H. (1961) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1961.tb03975.x · Cited by 862
Algorithmic Self-Assembly of DNA Sierpinski Triangles
Rothemund, P. W. K., Papadakis, N., & Winfree, E. (2004) · PLoS Biology · doi:10.1371/journal.pbio.0020424 · Cited by 860
Self-citationDunitz, J. D., & Bernstein, J. (1995) · Accounts of Chemical Research · doi:10.1021/ar00052a005 · Cited by 843
DNA double-crossover molecules
Fu, T. J., & Seeman, N. C. (1993) · Biochemistry · doi:10.1021/bi00064a003 · Cited by 828
Logical computation using algorithmic self-assembly of DNA triple-crossover molecules
Mao, C., LaBean, T. H., Reif, J. H., & Seeman, N. C. (2000) · Nature · doi:10.1038/35035038 · Cited by 779 · cited 1×
“Tile-based self-assembly programs have been demonstrated experimentally by using DNA tiles (15) to create periodic (16–18), finite (19, 20), and algorithmic (21–23) patterns.”
MethodConstruction, Analysis, Ligation, and Self-Assembly of DNA Triple Crossover Complexes
LaBean, T. H., Yan, H., Kopatsch, J., Liu, F., Winfree, E., Reif, J. H., & Seeman, N. C. (2000) · Journal of the American Chemical Society · doi:10.1021/ja993393e · Cited by 704
Self-citationGenetic takeover and the mineral origins of life
Cairns-Smith, A. G. (1982) · Medical Entomology and Zoology · Cited by 591
Building Programmable Jigsaw Puzzles with RNA
Chworos, A., Severcan, I., Koyfman, A. Y., Weinkam, P., Oroudjev, E., Hansma, H. G., & Jaeger, L. (2004) · Science · doi:10.1126/science.1104686 · Cited by 500
The program-size complexity of self-assembled squares (extended abstract)
Rothemund, P. W. K., & Winfree, E. (2000) · Proceedings of the thirty-second annual ACM symposium on Theory of computing · doi:10.1145/335305.335358 · Cited by 407
Self-citationDirected nucleation assembly of DNA tile complexes for barcode-patterned lattices
Yan, H., LaBean, T. H., Feng, L., & Reif, J. H. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1032954100 · Cited by 312
Models of Computation: Exploring the Power of Computing
Savage, J. E. (1998) · Cited by 293
Finite‐Size, Fully Addressable DNA Tile Lattices Formed by Hierarchical Assembly Procedures
Park, S. H., Pistol, C., Ahn, S. J., Reif, J. H., Lebeck, A. R., Dwyer, C., & LaBean, T. H. (2006) · Angewandte Chemie International Edition · doi:10.1002/anie.200503797 · Cited by 286
Complexity of Self‐Assembled Shapes
Soloveichik, D., & Winfree, E. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539704446712 · Cited by 252
Self-citationRunning time and program size for self-assembled squares
Adleman, L., Cheng, Q., Goel, A., & Huang, M.-D. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380881 · Cited by 233
Two Computational Primitives for Algorithmic Self-Assembly: Copying and Counting
Barish, R. D., Rothemund, P. W. K., & Winfree, E. (2005) · Nano Letters · doi:10.1021/nl052038l · Cited by 222
Self-citationThe program-size complexity of self-assembled squares
Rothemund, P. W. K., & Winfree, E. (2000) · Cited by 217
Self-citationSingle Wall Carbon Nanotube Amplification: En Route to a Type-Specific Growth Mechanism
Smalley, R. E., Li, Y., Moore, V. C., Price, B. K., Colorado, R., Schmidt, H. K., Hauge, R. H., Barron, A. R., & Tour, J. M. (2006) · Journal of the American Chemical Society · doi:10.1021/ja065767r · Cited by 215
Proofreading Tile Sets: Error Correction for Algorithmic Self-Assembly
Winfree, E., & Bekbolatov, R. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24628-2_13 · Cited by 209
Self-citationToward Reliable Algorithmic Self-Assembly of DNA Tiles: A Fixed-Width Cellular Automaton Pattern
Fujibayashi, K., Hariadi, R., Park, S. H., Winfree, E., & Murata, S. (2008) · Nano Letters · doi:10.1021/nl0722830 · Cited by 209
Self-citationOn the computational power of DNA annealing and ligation
Winfree, E. (1996) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/027/09 · Cited by 197
Self-citationFlynn, C. E., Mao, C., Hayhurst, A., Williams, J. L., Georgiou, G., Iverson, B., & Belcher, A. M. (2003) · J. Mater. Chem. · doi:10.1039/b307593a · Cited by 183
Synthesis of crystals with a programmable kinetic barrier to nucleation
Schulman, R., & Winfree, E. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0701467104 · Cited by 178
Self-citationComplexities for Generalized Models of Self-Assembly
Aggarwal, G., Cheng, Q., Goldwasser, M. H., Kao, M.-Y., de Espanes, P. M., & Schweller, R. T. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539704445202 · Cited by 160
Simulations of Computing by Self-Assembly
Winfree, E. (1998) · CaltechAUTHORS (California Institute of Technology) · doi:10.7907/z9tb14x7 · Cited by 147
Self-citationSturdier DNA Nanotubes via Ligation
O’Neill, P., Rothemund, P. W. K., Kumar, A., & Fygenson, D. K. (2006) · Nano Letters · doi:10.1021/nl0603505 · Cited by 137
Self-citationError Free Self-assembly Using Error Prone Tiles
Chen, H.-L., & Goel, A. (2005) · Lecture notes in computer science · doi:10.1007/11493785_6 · Cited by 110
Winfree, E. (2006) · Springer eBooks · doi:10.1007/3-540-30296-4_4 · Cited by 83
Self-citationProgrammable Control of Nucleation for Algorithmic Self-Assembly
Schulman, R., & Winfree, E. (2009) · SIAM Journal on Computing · doi:10.1137/070680266 · Cited by 81
Self-citationGenetic Takeover and the Mineral Origins of Life
Ninio, J. (1983) · FEBS Letters · doi:10.1016/0014-5793(83)80911-9 · Cited by 68
Reducing Facet Nucleation during Algorithmic Self-Assembly
Chen, H.-L., Schulman, R., Goel, A., & Winfree, E. (2007) · Nano Letters · doi:10.1021/nl070793o · Cited by 63
Self-citationChemistry and the Missing Era of Evolution
Cairns‐Smith, A. G. (2008) · Chemistry – A European Journal · doi:10.1002/chem.200701215 · Cited by 55
Programmable Control of Nucleation for Algorithmic Self-assembly
Schulman, R., & Winfree, E. (2005) · Lecture notes in computer science · doi:10.1007/11493785_28 · Cited by 47
Self-citationClay minerals and the origin of life
TREWAVAS, A. J. (1987) · FEBS Letters · doi:10.1016/0014-5793(87)80224-7 · Cited by 41
A Microfluidic Device for DNA Tile Self-assembly
Somei, K., Kaneda, S., Fujii, T., & Murata, S. (2006) · Lecture notes in computer science · doi:10.1007/11753681_25 · Cited by 19
(2006) · Thammasat University Digital Collections
Cited by
Rapid prototyping of 3D DNA-origami shapes with caDNAno
Douglas, S. M., Marblestone, A. H., Teerapittayanon, S., Vazquez, A., Church, G. M., & Shih, W. M. (2009) · Nucleic Acids Research · doi:10.1093/nar/gkp436 · Cited by 1,224
DNA Nanotechnology-Enabled Drug Delivery Systems
Hu, Q., Li, H., Wang, L., Gu, H., & Fan, C. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.7b00663 · Cited by 1,118
DNA Origami: Scaffolds for Creating Higher Order Structures
Hong, F., Zhang, F., Liu, Y., & Yan, H. (2017) · Chemical Reviews · doi:10.1021/acs.chemrev.6b00825 · Cited by 1,086
Self-assembly of carbon nanotubes into two-dimensional geometries using DNA origami templates
Maune, H. T., Han, S.-P., Barish, R. D., Bockrath, M., III, W. A. G., Rothemund, P. W. K., & Winfree, E. (2010) · Nature Nanotechnology · doi:10.1038/nnano.2009.311 · Cited by 622
Self-citationNucleic Acid Based Molecular Devices
Krishnan, Y., & Simmel, F. C. (2011) · Angewandte Chemie International Edition · doi:10.1002/anie.200907223 · Cited by 572
Metadata
- Authors
- Barish, R. D., Schulman, R., Rothemund, P. W. K., & Winfree, E.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2009-04-14
- Volume
- 106
- Issue
- 15
- Pages
- 6054-6059
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2135520597
- Cited by
- 267
- References
- 44
- FWCI
- 9.60
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.