Skip to main content

Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation

  • Conference paper
DNA Computing and Molecular Programming (DNA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8727))

Included in the following conference series:


We study the power of uncontrolled random molecular movement in a model of self-assembly called the nubots model. The nubots model is an asynchronous nondeterministic cellular automaton augmented with rigid-body movement rules (push/pull, deterministically and programmatically applied to specific monomers) and random agitations (nondeterministically applied to every monomer and direction with equal probability all of the time). Previous work on nubots showed how to build simple shapes such as lines and squares quickly—in expected time that is merely logarithmic of their size. These results crucially make use of the programmable rigid-body movement rule: the ability for a single monomer to push or pull large objects quickly, and only at a time and place of the programmers’ choosing. However, in engineered molecular systems, molecular motion is largely uncontrolled and fundamentally random. This raises the question of whether similar results can be achieved in a more restrictive, and perhaps easier to justify, model where uncontrolled random movements, or agitations, are happening throughout the self-assembly process and are the only form of rigid-body movement. We show that this is indeed the case: we give a polylogarithmic expected time construction for squares using agitation, and a sublinear expected time construction to build a line. Such results are impossible in an agitation-free (and movement-free) setting and thus show the benefits of exploiting uncontrolled random movement.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others


  1. Bath, J., Turberfield, A.: DNA nanomachines. Nature Nanotechnology 2, 275–284 (2007)

    Article  Google Scholar 

  2. Chen, M., Xin, D., Woods, D.: Parallel computation using active self-assembly. In: Soloveichik, D., Yurke, B. (eds.) DNA 2013. LNCS, vol. 8141, pp. 16–30. Springer, Heidelberg (2013); Full version: arXiv:1405.0527

    Chapter  Google Scholar 

  3. Dabby, N., Chen, H.-L.: Active self-assembly of simple units using an insertion primitive. In: SODA: Proceedings of the Twenty-fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1526–1536 (January 2012)

    Google Scholar 

  4. Dawes-Hoang, R.E., Parmar, K.M., Christiansen, A.E., Phelps, C.B., Brand, A.H., Wieschaus, E.F.: Folded gastrulation, cell shape change and the control of myosin localization. Development 132(18), 4165–4178 (2005)

    Article  Google Scholar 

  5. Doty, D.: Theory of algorithmic self-assembly. Communications of the ACM 55, 78–88 (2012)

    Article  Google Scholar 

  6. Doty, D., Lutz, J.H., Patitz, M.J., Schweller, R.T., Summers, S.M., Woods, D.: The tile assembly model is intrinsically universal. In: FOCS: Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, pp. 439–446 (October 2012)

    Google Scholar 

  7. Martin, A.C., Kaschube, M., Wieschaus, E.F.: Pulsed contractions of an actin–myosin network drive apical constriction. Nature 457(7228), 495–499 (2008)

    Article  Google Scholar 

  8. Patitz, M.J.: An introduction to tile-based self-assembly. In: Durand-Lose, J., Jonoska, N. (eds.) UCNC 2012. LNCS, vol. 7445, pp. 34–62. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  9. Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology (June 1998)

    Google Scholar 

  10. Woods, D.: Intrinsic universality and the computational power of self-assembly. In: MCU: Proceedings of Machines, Computations and Universality, September 9-12. Electronic Proceedings in Theoretical Computer Science, vol. 128, pp. 16–22 (2013)

    Google Scholar 

  11. Woods, D., Chen, H.-L., Goodfriend, S., Dabby, N., Winfree, E., Yin, P.: Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. In ITCS 2013: Proceedings of the 4th conference on Innovations in Theoretical Computer Science, pp. 353–354. ACM (2013) Full version: arXiv:1301.2626 [cs.DS]

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Chen, HL., Doty, D., Holden, D., Thachuk, C., Woods, D., Yang, CT. (2014). Fast Algorithmic Self-assembly of Simple Shapes Using Random Agitation. In: Murata, S., Kobayashi, S. (eds) DNA Computing and Molecular Programming. DNA 2014. Lecture Notes in Computer Science, vol 8727. Springer, Cham.

Download citation

  • DOI:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11294-7

  • Online ISBN: 978-3-319-11295-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics