Author:
Kari Lila,Kopecki Steffen,Seki Shinnosuke
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications
Reference15 articles.
1. Czeizler E, Popa A (2012) Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly. In: DNA computing and molecular programming, Springer, Berlin, pp 58–72
2. Göös M, Orponen P (2011) Synthesizing minimal tile sets for patterned DNA self-assembly. In: DNA computing and molecular programming, Springer, Berlin, pp. 71–82
3. Johnsen A, Kao MY, Seki S A manually-checkable proof for the NP-hardness of 11-colored patterned self-assembly of tile set synthesis. In: Preparation
4. Johnsen A, Kao MY, Seki S (2013) Computing minimum tile sets to self-assemble color patterns. In: ISAAC 2013 Proceedings of the 24th international symposium on algorithms and computation, LNCS, vol 8283, Springer, pp 699–710
5. Kari L, Kopecki S, Meunier PÉ, Patitz MJ, Seki S (2014) Binary pattern tile set synthesis is NP-hard. arXiv, preprint http://arxiv.org/abs/1404.0967arXiv:1404.0967
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献