Active self-assembly of algorithmic shapes and patterns in polylogarithmic time

ABSTRACT

We describe a computational model for studying the complexity of self-assembled structures with active molecular components. Our model captures notions of growth and movement ubiquitous in biological systems. The model is inspired by biology's fantastic ability to assemble biomolecules that form systems with complicated structure and dynamics, from molecular motors that walk on rigid tracks and proteins that dynamically alter the structure of the cell during mitosis, to embryonic development where large scale complicated organisms efficiently grow from a single cell. Using this active self-assembly model, we show how to efficiently self-assemble shapes and patterns from simple monomers. For example we show how to grow a line of monomers in time and number of monomer states that is merely logarithmic in its length. Our main results show how to grow arbitrary connected two-dimensional geometric shapes and patterns in expected time polylogarithmic in the size of the shape plus roughly the time required to run a Turing machine deciding whether or not a given pixel is in the shape. We do this while keeping the number of monomer types logarithmic in shape size, plus monomers required by the Kolmogorov complexity of the shape or pattern. This work thus highlights the fundamental efficiency advantage of active self-assembly over passive self-assembly and motivates experimental effort to construct self-assembly systems with active molecular components.

References

1. Leonard M. Adleman, Qi Cheng, Ashish Goel, and Ming-Deh Huang. Running time and program size for self-assembled squares. In STOC 2001, pp 740--748.
2. Greg Aloupis, Sébastien Collette, Erik D. Demaine, Stefan Langerman, Vera Sacristán, and Stefanie Wuhrer. Reconfiguration of cube-style modular robots using O(log n) parallel moves. In Algorithms and Computation, pages 342--353. Springer, 2008.
3. Aristid Lindenmayer. Mathematical models for cellular interactions in development I. Filaments with one-sided inputs. J. Theor. Biol., 18(3):280--299, 1968.
4. Paul W.K. Rothemund. Folding DNA to create nanoscale shapes and patterns. Nature, 440(7082):297--302, 2006.
5. David Soloveichik, Matthew Cook, Erik Winfree, and Jehoshua Bruck. Computation with finite stochastic chemical reaction networks. Natural Computing, 7(4):615--633, 2008.
6. Erik Winfree, Furong Liu, Lisa Wenzler, and Nadrian C. Seeman. Design and self-assembly of two-dimensional DNA crystals. Nature, 394:539--544, 1998.

Index Terms

• Theory of computation

  • Models of computation

    • Computability