Skip to main content

Robustness in Self-Assembly

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms
  • 39 Accesses

Years and Authors of Summarized Original Work

  • 2004; Winfree, Bekbolatov

  • 2004; Chen, Goel

Robustness in Self-Assembly

The abstract tile assembly model (aTAM), originally proposed by Winfree [1], provides a useful framework to study algorithmic tile self-assembly. As described in other sections, many theoretical studies have shown the efficiency and computational power of aTAM.

The aTAM, although widely accepted and experimentally verified, is an overly simplified combinatorial model in describing the self-assembly of DNA tiles. In reality, several effects are observed which lead to a loss of robustness compared to the aTAM. The assembly tends to be reversible, i.e., tiles can fall off from an existing assembly, even when the total binding strength exceeds the temperature threshold Ï„. Also, tiles sometimes attach with a weak strength but then quickly get incorporated and locked into a growing assembly, much like defects in a crystal. However, for sophisticated combinatorial assemblies...

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Winfree E (1998) Algorithmic self-assembly of DNA. PhD thesis, California Institute of Technology

    Google Scholar 

  2. Winfree E, Bekbolatov R (2004) Proofreading tile sets: error correction for algorithmic self-assembly. In: DNA computers 9. LNCS, vol 2943. Springer, Berlin/Heidelberg, pp 126–144

    Google Scholar 

  3. Chen HL, Goel A (2004) Error free self-assembly using error prone tiles. In: Tenth international meeting on DNA computing, Milano

    MATH  Google Scholar 

  4. Chen HL, Goel A, Luhrs C (2008) Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly. In: ACM-SIAM symposium on discrete algorithms, San Francisco

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ho-Lin Chen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Chen, HL. (2016). Robustness in Self-Assembly. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_664

Download citation

Publish with us

Policies and ethics