PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
December 1, 2004PLoS Biology881 citationsOpen Access

Algorithmic Self-Assembly of DNA Sierpinski Triangles

PRPaul W. K. RothemundNPNick PapadakisEWErik Winfree

Key Points

Key points are not available for this paper at this time.

Abstract

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.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Rothemund et al. (2004) studied this question.

synapsesocial.com/papers/69dd511880eea7d3f699b3ebhttps://doi.org/10.1371/journal.pbio.0020424
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Programmable Control of Nucleation for Algorithmic Self-assembly2005 · 49 citations
  2. 2Proofreading Tile Sets: Error Correction for Algorithmic Self-Assembly2004 · 212 citations
  3. 3On the computational power of DNA annealing and ligation1996 · 199 citations
  4. 4Randomness conservation inequalities; information and independence in mathematical theories1984 · 265 citations
  5. 5On Computable Numbers, with an Application to the Entscheidungsproblem1937 · 8,154 citations