{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T14:05:10Z","timestamp":1725113110311},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,5,6]],"date-time":"2011-05-06T00:00:00Z","timestamp":1304640000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s00453-011-9522-5","type":"journal-article","created":{"date-parts":[[2011,5,5]],"date-time":"2011-05-05T18:00:24Z","timestamp":1304618424000},"page":"117-136","source":"Crossref","is-referenced-by-count":25,"title":["Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming"],"prefix":"10.1007","volume":"63","author":[{"given":"Scott M.","family":"Summers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,5,6]]},"reference":[{"key":"9522_CR1","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1145\/380752.380881","volume-title":"Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing (STOC 2001)","author":"L. Adleman","year":"2001","unstructured":"Adleman, L., Cheng, Q., Goel, A., Huang, M.-D.: Running time and program size for self-assembled squares. In: Proceedings of the Thirty-third Annual ACM Symposium on Theory of Computing (STOC 2001), New York, NY, USA, pp. 740\u2013748. ACM, New York (2001)"},{"issue":"15","key":"9522_CR2","doi-asserted-by":"crossref","first-page":"6054","DOI":"10.1073\/pnas.0808736106","volume":"106","author":"R.D. Barish","year":"2009","unstructured":"Barish, R.D., Schulman, R., Rothemund, P.W., Winfree, E.: An information-bearing seed for nucleating algorithmic self-assembly. Proc. Natl. Acad. Sci. USA 106(15), 6054\u20136059 (2009)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"9522_CR3","first-page":"45","volume-title":"Foundations of Software Technology and Theoretical Computer Science (FSTTCS)","author":"F. Becker","year":"2006","unstructured":"Becker, F., Rapaport, I., R\u00e9mila, E.: Self-assembling classes of shapes with a minimum number of tiles, and in optimal time. In: Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 45\u201356 (2006)"},{"key":"9522_CR4","volume-title":"Proceedings of the 10th International Meeting on DNA Based Computers","author":"H.-L. Chen","year":"2004","unstructured":"Chen, H.-L., Goel, A.: Error free self-assembly with error prone tiles. In: Proceedings of the 10th International Meeting on DNA Based Computers (2004)"},{"key":"9522_CR5","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1137\/S0097539704445202","volume":"34","author":"Q. Cheng","year":"2005","unstructured":"Cheng, Q., Aggarwal, G., Goldwasser, M.H., Kao, M.-Y., Schweller, R.T., de Espan\u00e9s, P.M.: Complexities for generalized models of self-assembly. SIAM J. Comput. 34, 1493\u20131515 (2005)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9522_CR6","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s11047-008-9073-0","volume":"7","author":"E.D. Demaine","year":"2008","unstructured":"Demaine, E.D., Demaine, M.L., Fekete, S.P., Ishaque, M., Rafalin, E., Schweller, R.T., Souvaine, D.L.: Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues. Nat. Comput. 7(3), 347\u2013370 (2008)","journal-title":"Nat. Comput."},{"issue":"8","key":"9522_CR7","doi-asserted-by":"crossref","first-page":"3521","DOI":"10.1137\/090779152","volume":"39","author":"D. Doty","year":"2010","unstructured":"Doty, D.: Randomized self-assembly for exact shapes. SIAM J. Comput. 39(8), 3521\u20133552 (2010)","journal-title":"SIAM J. Comput."},{"key":"9522_CR8","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"275","volume-title":"Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010)","author":"D. Doty","year":"2010","unstructured":"Doty, D., Lutz, J.H., Patitz, M.J., Summers, S.M., Woods, D.: Intrinsic universality in self-assembly. In: Marion, J.-Y., Schwentick, T. (eds.) Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), Dagstuhl, Germany. Leibniz International Proceedings in Informatics (LIPIcs), vol. 5, pp. 275\u2013286. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Wadern (2010)"},{"key":"9522_CR9","first-page":"571","volume-title":"Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006)","author":"M.-Y. Kao","year":"2007","unstructured":"Kao, M.-Y., Schweller, R.T.: Reducing tile complexity for self-assembly through temperature programming. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), Miami, Florida, Jan. 2006, pp. 571\u2013580 (2007)"},{"key":"9522_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1007\/978-3-540-70575-8_31","volume-title":"International Colloqium on Automata, Languages, and Programming (ICALP)","author":"M.-Y. Kao","year":"2008","unstructured":"Kao, M.-Y., Schweller, R.T.: Randomized self-assembly for approximate shapes. In: International Colloqium on Automata, Languages, and Programming (ICALP). Lecture Notes in Computer Science, vol. 5125, pp. 370\u2013384. Springer, Berlin (2008)"},{"key":"9522_CR11","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/j.tcs.2008.09.062","volume":"410","author":"J.I. Lathrop","year":"2009","unstructured":"Lathrop, J.I., Lutz, J.H., Summers, S.M.: Strict self-assembly of discrete Sierpinski triangles. Theor. Comput. Sci. 410, 384\u2013405 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"9522_CR12","series-title":"DIMACS","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1090\/dimacs\/048\/17","volume-title":"DNA Based Computers III","author":"J.H. Reif","year":"1999","unstructured":"Reif, J.H.: Local parallel biomolecular computing. In: DNA Based Computers III. DIMACS, vol. 48, pp. 217\u2013254. Am. Math. Soc., Providence (1999)"},{"key":"9522_CR13","unstructured":"Rothemund, P.W.K.: Theory and experiments in algorithmic self-assembly. Ph.D. thesis, University of Southern California, December 2001"},{"issue":"7082","key":"9522_CR14","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1038\/nature04586","volume":"440","author":"P.W.K. Rothemund","year":"2006","unstructured":"Rothemund, P.W.K.: Folding DNA to create nanoscale shapes and patterns. Nature 440(7082), 297\u2013302 (2006)","journal-title":"Nature"},{"key":"9522_CR15","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1145\/335305.335358","volume-title":"Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing (STOC 2000)","author":"P.W.K. Rothemund","year":"2000","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing (STOC 2000), New York, NY, USA, pp. 459\u2013468. ACM, New York (2000)"},{"issue":"12","key":"9522_CR16","first-page":"2041","volume":"2","author":"P.W.K. Rothemund","year":"2004","unstructured":"Rothemund, P.W.K., Papadakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biol. 2(12), 2041\u20132053 (2004)","journal-title":"PLoS Biol."},{"key":"9522_CR17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0022-5193(82)90002-9","volume":"99","author":"N.C. Seeman","year":"1982","unstructured":"Seeman, N.C.: Nucleic-acid junctions and lattices. J. Theor. Biol. 99, 237\u2013247 (1982)","journal-title":"J. Theor. Biol."},{"issue":"6","key":"9522_CR18","doi-asserted-by":"crossref","first-page":"1544","DOI":"10.1137\/S0097539704446712","volume":"36","author":"D. Soloveichik","year":"2007","unstructured":"Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. SIAM J. Comput. 36(6), 1544\u20131569 (2007)","journal-title":"SIAM J. Comput."},{"key":"9522_CR19","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"P. Vit\u00e1nyi","year":"1997","unstructured":"Vit\u00e1nyi, P., Li, M.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, Berlin (1997)"},{"issue":"1","key":"9522_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"XL","author":"H. Wang","year":"1961","unstructured":"Wang, H.: Proving theorems by pattern recognition\u2014II. Bell Syst. Tech. J. XL(1), 1\u201341 (1961)","journal-title":"Bell Syst. Tech. J."},{"key":"9522_CR21","first-page":"23","volume-title":"Proceedings of the Symposium on Mathematical Theory of Automata","author":"H. Wang","year":"1963","unstructured":"Wang, H.: Dominoes and the AEA case of the decision problem. In: Proceedings of the Symposium on Mathematical Theory of Automata, New York, 1962, pp. 23\u201355. Polytechnic Press of Polytechnic Inst. of Brooklyn, Brooklyn (1963)"},{"key":"9522_CR22","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. Ph.D. thesis, California Institute of Technology, June 1998"},{"key":"9522_CR23","series-title":"Lecture Notes in Computer Science","first-page":"126","volume-title":"DNA","author":"E. Winfree","year":"2003","unstructured":"Winfree, E., Bekbolatov, R.: Proofreading tile sets: Error correction for algorithmic self-assembly. In: Chen, J., Reif, J.H. (eds.) DNA. Lecture Notes in Computer Science, vol. 2943, pp. 126\u2013144. Springer, Berlin (2003)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9522-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9522-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9522-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T14:50:59Z","timestamp":1560178259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9522-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,6]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9522"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9522-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,6]]}}}