{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T02:35:44Z","timestamp":1726454144638},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540490241"},{"type":"electronic","value":"9783540684237"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11925903_8","type":"book-chapter","created":{"date-parts":[[2006,12,13]],"date-time":"2006-12-13T16:03:04Z","timestamp":1166025784000},"page":"95-110","source":"Crossref","is-referenced-by-count":2,"title":["On the Complexity of Graph Self-assembly in Accretive Systems"],"prefix":"10.1007","author":[{"given":"Stanislav","family":"Angelov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjeev","family":"Khanna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirk\u00f3","family":"Visontai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Reif, J.H., Sahu, S., Yin, P.: Complexity of graph self-assembly in accretive systems and self-destructible systems. DNA Computing, 101\u2013112 (2005)","DOI":"10.1007\/11753681_21"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1038\/28998","volume":"394","author":"E. Winfree","year":"1998","unstructured":"Winfree, E., Liu, F., Wenzler, L.A., Seeman, N.C.: Design and self-assembly of two-dimensional DNA crystals. Nature\u00a0394, 539\u2013544 (1998)","journal-title":"Nature"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"984","DOI":"10.1073\/pnas.97.3.984","volume":"97","author":"P. Rothemund","year":"2000","unstructured":"Rothemund, P.: Using lateral capillary forces to compute by self-assembly. Proc. Nat. Acad. Sci. U.S.A.\u00a097, 984\u2013989 (2000)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"1848","DOI":"10.1021\/ja993393e","volume":"122","author":"T.H. LaBean","year":"2000","unstructured":"LaBean, T.H., Yan, H., Kopatsch, J., Liu, F., Winfree, E., Reif, J.H., Seeman, N.C.: Construction, analysis, ligation, and self-assembly of DNA triple crossover complexes. J. Amer. Chem. Soc.\u00a0122, 1848\u20131860 (2000)","journal-title":"J. Amer. Chem. Soc."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"8103","DOI":"10.1073\/pnas.1032954100","volume":"100","author":"H. Yan","year":"2003","unstructured":"Yan, H., LaBean, T.H., Feng, L., Reif, J.H.: Directed nucleation assembly of DNA tile complexes for barcode-patterned lattices. Proc. Nat. Acad. Sci. U.S.A.\u00a0100, 8103\u20138108 (2003)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"2041","DOI":"10.1371\/journal.pbio.0020424","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 Biology\u00a02, 2041\u20132053 (2004)","journal-title":"PLoS Biology"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"13924","DOI":"10.1021\/ja0458120","volume":"126","author":"N. Chelyapov","year":"2004","unstructured":"Chelyapov, N., Brun, Y., Gopalkrishnan, M., Reishus, D., Shaw, B., Adleman, L.M.: DNA triangles and self-assembled hexagonal tilings. J. Amer. Chem. Soc.\u00a0126, 13924\u201313925 (2004)","journal-title":"J. Amer. Chem. Soc."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"12202","DOI":"10.1021\/ja0541938","volume":"127","author":"Y. He","year":"2005","unstructured":"He, Y., Chen, Y., Liu, H., Ribbe, A.E., Mao, C.: Self-assembly of hexagonal DNA two-dimensional (2D) arrays. J. Amer. Chem. Soc.\u00a0127, 12202\u201312203 (2005)","journal-title":"J. Amer. Chem. Soc."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"3057","DOI":"10.1002\/anie.200463027","volume":"44","author":"J. Malo","year":"2005","unstructured":"Malo, J., Mitchell, J.C., V\u00e9nien-Bryan, C., Harris, J.R., Wille, H., Sherratt, D.J., Turberfield, A.J.: Engineering a 2D protein-DNA crystal. Angewandte Chemie International Edition\u00a044, 3057\u20133061 (2005)","journal-title":"Angewandte Chemie International Edition"},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/j.1538-7305.1961.tb03975.x","volume":"40","author":"H. Wang","year":"1961","unstructured":"Wang, H.: Proving theorems by pattern recognition II. Bell Systems Technical Journal\u00a040, 1\u201341 (1961)","journal-title":"Bell Systems Technical Journal"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: STOC, pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Winfree, E., Bekbolatov, R.: Proofreading tile sets: Error correction for algorithmic self-assembly. DNA Based Computers, 126\u2013144 (2003)","DOI":"10.1007\/978-3-540-24628-2_13"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Chen, H.L., Goel, A.: Error free self-assembly using error prone tiles. DNA Computing, 62\u201375 (2004)","DOI":"10.1007\/11493785_6"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0020-0190(79)90023-1","volume":"8","author":"J. Plesn\u00edk","year":"1979","unstructured":"Plesn\u00edk, J.: The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two. Inform. Process. Lett.\u00a08, 199\u2013201 (1979)","journal-title":"Inform. Process. Lett."},{"key":"8_CR15","doi-asserted-by":"crossref","first-page":"259","DOI":"10.7151\/dmgt.1053","volume":"17","author":"H. Broersma","year":"1997","unstructured":"Broersma, H., Li, X.: Spanning trees with many or few colors in edge-colored graphs. Discuss. Math. Graph Theory\u00a017, 259\u2013269 (1997)","journal-title":"Discuss. Math. Graph Theory"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Adleman, L.M., Cheng, Q., Goel, A., Huang, M.D.A., Kempe, D., de Espan\u00e9s, P.M., Rothemund, P.W.K.: Combinatorial optimization problems in self-assembly. In: STOC, pp. 23\u201332 (2002)","DOI":"10.1145\/509909.509913"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Adleman, L.M., Cheng, Q., Goel, A., Huang, M.D.A.: Running time and program size for self-assembled squares. In: STOC, pp. 740\u2013748 (2001)","DOI":"10.1145\/380752.380881"},{"key":"8_CR18","unstructured":"Aggarwal, G., Goldwasser, M., Kao, M.Y., Schweller, R.T.: Complexities for generalized models of self-assembly. In: SODA, pp. 880\u2013889 (2004)"},{"key":"8_CR19","unstructured":"Sahu, S., Yin, P., Reif, J.H.: A self-assembly model of DNA tiles with time dependent glue strength. DNA Computing, 113\u2013124 (2005)"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Kao, M.Y., Schweller, R.: Reducing tile complexity for self-assembly through temperature programming. In: SODA, pp. 571\u2013580 (2006)","DOI":"10.1145\/1109557.1109620"},{"key":"8_CR21","unstructured":"Chen, H.L., Cheng, Q., Goel, A., Huang, M.D.A., de Espan\u00e9s, P.M.: Invadable self-assembly: combining robustness with efficiency. In: SODA, pp. 890\u2013899 (2004)"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Fujibayashi, K., Murata, S.: A method of error suppression for self-assembling DNA tiles. DNA Computing, 113\u2013127 (2004)","DOI":"10.1007\/11493785_10"},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Reif, J.H., Sahu, S., Yin, P.: Compact error-resilient computational DNA tiling assemblies. DNA Computing, 293\u2013307 (2004)","DOI":"10.1007\/11493785_26"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Schulman, R., Winfree, E.: Programmable control of nucleation for algorithmic self-assembly. DNA Computing, 319\u2013328 (2004)","DOI":"10.1007\/11493785_28"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. DNA Computing, 344\u2013354 (2004)","DOI":"10.1007\/11493785_30"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Soloveichik, D., Winfree, E.: Complexity of compact proofreading for self-assembled patterns. DNA Computing, 125\u2013135 (2005)","DOI":"10.1007\/11753681_24"},{"key":"8_CR27","unstructured":"Lagoudakis, M.G., LaBean, T.H.: 2D DNA self-assembly for satisfiability. DNA Based Computers, 139\u2013152 (1999)"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Cook, M., Rothemund, P.W.K., Winfree, E.: Self-assembled circuit patterns. DNA Based Computers, 91\u2013107 (2003)","DOI":"10.1007\/978-3-540-24628-2_11"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Schulman, R., Lee, S., Papadakis, N., Winfree, E.: One dimensional boundaries for DNA tile self-assembly. DNA Based Computers, 108\u2013126 (2003)","DOI":"10.1007\/978-3-540-24628-2_12"},{"key":"8_CR30","doi-asserted-by":"publisher","first-page":"2586","DOI":"10.1021\/nl052038l","volume":"5","author":"R.D. Barish","year":"2005","unstructured":"Barish, R.D., Rothemund, P.W.K., Winfree, E.: Two computational primitives for algorithmic self-assembly: Copying and counting. Nano Letters\u00a05, 2586\u20132592 (2005)","journal-title":"Nano Letters"},{"key":"8_CR31","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0303-2647(99)00041-6","volume":"52","author":"N. Jonoska","year":"1999","unstructured":"Jonoska, N., Karl, S.A., Saito, M.: Three dimensional DNA structures in computing. BioSystems\u00a052, 143\u2013153 (1999)","journal-title":"BioSystems"},{"key":"8_CR32","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1023\/A:1023980828489","volume":"4","author":"N. Jonoska","year":"2003","unstructured":"Jonoska, N., Sa-Ardyen, P., Seeman, N.C.: Computation by self-assembly of DNA graphs. Genetic Programming and Evolvable Machines\u00a04, 123\u2013137 (2003)","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11560319_14","volume-title":"Unconventional Computation","author":"N. Jonoska","year":"2005","unstructured":"Jonoska, N., McColm, G.L.: A Computational Model for Self-assembling Flexible Tiles. In: Calude, C.S., Dinneen, M.J., P\u0103un, G., Jes\u00fas P\u00e9rez-J\u00edmenez, M., Rozenberg, G. (eds.) UC 2005. LNCS, vol.\u00a03699, pp. 142\u2013156. Springer, Heidelberg (2005)"},{"key":"8_CR34","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1109\/TAC.2006.876950","volume":"51","author":"E. Klavins","year":"2006","unstructured":"Klavins, E., Ghrist, R., Lipsky, D.: A grammatical approach to self-organizing robotic systems. IEEE Trans. Automat. Control\u00a051, 949\u2013962 (2006)","journal-title":"IEEE Trans. Automat. Control"},{"key":"8_CR35","unstructured":"Klavins, E.: Directed self-assembly using graph grammars. In: FNANO (2004)"},{"key":"8_CR36","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1023\/B:NACO.0000006771.95566.34","volume":"2","author":"P. Sa-Ardyen","year":"2003","unstructured":"Sa-Ardyen, P., Jonoska, N., Seeman, N.C.: Self-assembling DNA graphs. Natural Computing\u00a02, 427\u2013438 (2003)","journal-title":"Natural Computing"},{"key":"8_CR37","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput.\u00a011, 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"key":"8_CR38","doi-asserted-by":"publisher","first-page":"2571","DOI":"10.1103\/PhysRevE.59.2571","volume":"59","author":"A.A. Middleton","year":"1999","unstructured":"Middleton, A.A.: Computational complexity of determining the barriers to interface motion in random systems. Phys. Rev. E\u00a059, 2571\u20132577 (1999)","journal-title":"Phys. Rev. E"}],"container-title":["Lecture Notes in Computer Science","DNA Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11925903_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:46:28Z","timestamp":1619509588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11925903_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540490241","9783540684237"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/11925903_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}