The program-size complexity of self-assembled squares (extended abstract)

By Paul Wilhelm Karl Rothemund, Erik Winfree. Symposium on the Theory of Computing, 2000

485 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Design principles for self-assembly with short-range interactions (2011, methodology): “Local-rule-based approaches have been used extensively by Winfree and collaborators (16, 17), who have demonstrated that the number of component types needed for assembly is bounded by the algorithmic complexity of the structure.”
Algorithmic Self-Assembly of DNA Sierpinski Triangles (2004, background): “…an abstract tile set that enumerates binary numbers—a binary counter—uses just four tiles, yet it can be used to define the size of selfassembled structures (Rothemund and Winfree 2000), thus addressing the synthetic chemistry challenge of creating monodisperse particles with programmable size.”