Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming
暂无分享,去创建一个
[1] M. Sahani,et al. Algorithmic Self-Assembly of DNA , 2006 .
[2] Ming-Yang Kao,et al. Complexities for generalized models of self-assembly , 2004, SODA '04.
[3] Erik Winfree,et al. An information-bearing seed for nucleating algorithmic self-assembly , 2009, Proceedings of the National Academy of Sciences.
[4] Ashish Goel,et al. Running time and program size for self-assembled squares , 2001, STOC '01.
[5] Jack H. Lutz,et al. Strict self-assembly of discrete Sierpinski triangles , 2007, Theor. Comput. Sci..
[6] Leonard M. Adleman,et al. Theory and experiments in algorithmic self-assembly , 2001 .
[7] Ming-Yang Kao,et al. Randomized Self-assembly for Approximate Shapes , 2008, ICALP.
[8] David Doty,et al. Randomized Self-Assembly for Exact Shapes , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[9] Erik D. Demaine,et al. Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues , 2008, Natural Computing.
[10] Qi Cheng. On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields , 2005, SIAM J. Comput..
[11] P. Rothemund. Folding DNA to create nanoscale shapes and patterns , 2006, Nature.
[12] Ivan Rapaport,et al. Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time , 2006, FSTTCS.
[13] Erik Winfree,et al. Complexity of Self-Assembled Shapes , 2004, SIAM J. Comput..
[14] E. Winfree,et al. Algorithmic Self-Assembly of DNA Sierpinski Triangles , 2004, PLoS biology.
[15] Hao Wang. Dominoes and the Aea Case of the Decision Problem , 1990 .
[16] Erik Winfree,et al. The program-size complexity of self-assembled squares (extended abstract) , 2000, STOC '00.
[17] Hao Wang,et al. Proving theorems by pattern recognition I , 1960, Commun. ACM.
[18] Paul W. K. Rothemund,et al. Rothemund, P.W.K.: Folding DNA to create nanoscale shapes and patterns. Nature 440, 297-302 , 2006 .
[19] Erik Winfree,et al. Proofreading Tile Sets: Error Correction for Algorithmic Self-Assembly , 2003, DNA.
[20] William I. Gasarch,et al. Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.
[21] Hao Wang. Proving theorems by pattern recognition — II , 1961 .
[22] John H. Reif,et al. Local Parallel Biomolecular Computation , 1997, Int. J. Unconv. Comput..
[23] Ming-Yang Kao,et al. Reducing tile complexity for self-assembly through temperature programming , 2006, SODA '06.
[24] Paul M. B. Vitányi,et al. An Introduction to Kolmogorov Complexity and Its Applications , 1993, Graduate Texts in Computer Science.
[25] N. Seeman. Nucleic acid junctions and lattices. , 1982, Journal of theoretical biology.
[26] Jack H. Lutz,et al. Intrinsic Universality in Self-Assembly , 2010, STACS.