Skip to main content

Patterned Self-Assembly Tile Set Synthesis

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms
  • 56 Accesses

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. Czeizler E, Popa A (2012) Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly. In: Proceedings of the DNA 18, Aarhus. LNCS, vol 7433. Springer, pp 58–72

    Google Scholar 

  2. Göös M, Lampiäinen T, Czeizler E, Orponen P (2014) Search methods for tile sets in patterned DNA self-assembly. J Comput Syst Sci 80:297–319

    Article  MathSciNet  MATH  Google Scholar 

  3. Johnsen A, Kao MY, Seki S (2013) Computing minimum tile sets to self-assemble color patterns. In: Proceedings of the ISAAC 2013, Hong Kong. LNCS, vol 8283. Springer, pp 699–710

    Google Scholar 

  4. Johnsen A, Kao MY, Seki S (2014, Submitted) A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tile set synthesis

    Google Scholar 

  5. Kari L, Kopecki S, Seki S (2013) 3-color bounded patterned self-assembly. In: Proceedings of the DNA 19, Tempe. LNCS, vol 8141. Springer, pp 105–117

    Google Scholar 

  6. Kari L, Kopecki S, Étienne Meunier P, Patitz MJ, Seki S (2014) Binary pattern tile set synthesis is NP-hard. arXiv: 1404.0967

    Google Scholar 

  7. Ma X, Lombardi F (2008) Synthesis of tile sets for DNA self-assembly. IEEE Trans Comput-Aided Des Integr Circuits Syst 27(5):963–967

    Article  Google Scholar 

  8. Ma X, Lombardi F (2009) On the computational complexity of tile set synthesis for DNA self-assembly. IEEE Trans Circuits Syst II 56(1):31–35

    Article  Google Scholar 

  9. Seki S (2013) Combinatorial optimization in pattern assembly (extended abstract). In: Proceedings of the UCNC 2013, Milan. LNCS, vol 7956. Springer, pp 220–231

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shinnosuke Seki .

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

Seki, S. (2016). Patterned Self-Assembly Tile Set Synthesis. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_666

Download citation

Publish with us

Policies and ethics