{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:51:35Z","timestamp":1725576695717},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183041"},{"type":"electronic","value":"9783642183058"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18305-8_7","type":"book-chapter","created":{"date-parts":[[2011,1,21]],"date-time":"2011-01-21T01:58:40Z","timestamp":1295575120000},"page":"71-82","source":"Crossref","is-referenced-by-count":11,"title":["Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly"],"prefix":"10.1007","author":[{"given":"Mika","family":"G\u00f6\u00f6s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pekka","family":"Orponen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","first-page":"23","volume-title":"Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002)","author":"L. Adleman","year":"2002","unstructured":"Adleman, L., Cheng, Q., Goel, A., Huang, M.-D., Kempe, D., de Espan\u00e9s, P.M., Rothemund, P.W.K.: Combinatorial optimization problems in self-assembly. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 23\u201332. ACM, New York (2002)"},{"key":"7_CR2","unstructured":"G\u00f6\u00f6s, M., Orponen, P.: Synthesizing minimal tile sets for patterned DNA self-assembly. A detailed version, arXiv:0911.2924"},{"issue":"4-5","key":"7_CR3","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0410(4-5), 384\u2013405 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"8","key":"7_CR4","doi-asserted-by":"crossref","first-page":"1641","DOI":"10.1002\/cphc.200600260","volume":"7","author":"C. Lin","year":"2006","unstructured":"Lin, C., Liu, Y., Rinker, S., Yan, H.: DNA tile based self-assembly: building complex nanoarchitectures. Chem. Phys. Chem.\u00a07(8), 1641\u20131647 (2006)","journal-title":"Chem. Phys. Chem."},{"issue":"5","key":"7_CR5","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1109\/TCAD.2008.917973","volume":"27","author":"X. Ma","year":"2008","unstructured":"Ma, X., Lombardi, F.: Synthesis of tile sets for DNA self-assembly. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a027(5), 963\u2013967 (2008)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/TCSII.2008.2010161","volume":"56","author":"X. Ma","year":"2009","unstructured":"Ma, X., Lombardi, F.: On the computational complexity of tile set synthesis for DNA self-assembly. IEEE Transactions on Circuits and Systems II: Express Briefs\u00a056(1), 31\u201335 (2009)","journal-title":"IEEE Transactions on Circuits and Systems II: Express Briefs"},{"issue":"5","key":"7_CR7","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1002\/anie.200503797","volume":"45","author":"S.H. Park","year":"2006","unstructured":"Park, S.H., Pistol, C., Ahn, S.J., Reif, J.H., Lebeck, A.R., Dwyer, C., LaBean, T.H.: Finite-size, fully addressable DNA tile lattices formed by hierarchical assembly procedures. Angewandte Chemie International Edition\u00a045(5), 735\u2013739 (2006)","journal-title":"Angewandte Chemie International Edition"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1088\/0957-4484\/15\/10\/005","volume":"15","author":"S.H. Park","year":"2004","unstructured":"Park, S.H., Yan, H., Reif, J.H., LaBean, T.H., Finkelstein, G.: Electronic nanostructures templated on self-assembled DNA scaffolds. Nanotechnology\u00a015, S525\u2013S527 (2004)","journal-title":"Nanotechnology"},{"key":"7_CR9","unstructured":"Rothemund, P.W.K.: Theory and Experiments in Algorithmic Self-assembly. PhD thesis, University of Southern California (2001)"},{"key":"7_CR10","doi-asserted-by":"publisher","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\u00a0440, 297\u2013302 (2006)","journal-title":"Nature"},{"key":"7_CR11","first-page":"459","volume-title":"Proceedings of the 32nd 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 32nd Annual ACM Symposium on Theory of Computing (STOC 2000), pp. 459\u2013468. ACM, New York (2000)"},{"key":"7_CR12","unstructured":"Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology (1998)"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"1882","DOI":"10.1126\/science.1089389","volume":"301","author":"H. Yan","year":"2003","unstructured":"Yan, H., Park, S.H., Finkelstein, G., Reif, J.H., LaBean, T.H.: DNA-templated self-assembly of protein arrays and highly conducive nanowires. Science\u00a0301, 1882\u20131884 (2003)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","DNA Computing and Molecular Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18305-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T19:41:37Z","timestamp":1553370097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18305-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183041","9783642183058"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18305-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}