Computing Minimum Tile Sets to Self-Assemble Color Patterns
暂无分享,去创建一个
[1] Shinnosuke Seki. Combinatorial Optimization in Pattern Assembly , 2013, ArXiv.
[2] Erik Winfree,et al. The program-size complexity of self-assembled squares (extended abstract) , 2000, STOC '00.
[3] Erik Winfree,et al. An information-bearing seed for nucleating algorithmic self-assembly , 2009, Proceedings of the National Academy of Sciences.
[4] M. Sahani,et al. Algorithmic Self-Assembly of DNA , 2006 .
[5] Xiaojun Ma,et al. Synthesis of Tile Sets for DNA Self-Assembly , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[6] Yuriy Brun. Arithmetic computation in the tile assembly model: Addition and multiplication , 2007, Theor. Comput. Sci..
[7] Alexandru Popa,et al. Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly , 2013, Theor. Comput. Sci..
[8] N. Seeman,et al. Design and self-assembly of two-dimensional DNA crystals , 1998, Nature.
[9] Yuriy Brun. Solving NP-complete problems in the tile assembly model , 2008, Theor. Comput. Sci..
[10] E. Winfree,et al. Algorithmic Self-Assembly of DNA Sierpinski Triangles , 2004, PLoS biology.
[11] Yuriy Brun. Improving Efficiency of 3-SAT-Solving Tile Systems , 2010, DNA.
[12] Erik Winfree,et al. On the computational power of DNA annealing and ligation , 1995, DNA Based Computers.
[13] Fabrizio Lombardi,et al. On the Computational Complexity of Tile Set Synthesis for DNA Self-Assembly , 2009, IEEE Transactions on Circuits and Systems II: Express Briefs.
[14] Yuriy Brun. Solving satisfiability in the tile assembly model with a constant-size tileset , 2008, J. Algorithms.