{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:58:14Z","timestamp":1725544694885},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540341611"},{"type":"electronic","value":"9783540341659"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11753681_24","type":"book-chapter","created":{"date-parts":[[2006,7,28]],"date-time":"2006-07-28T06:31:54Z","timestamp":1154068314000},"page":"305-324","source":"Crossref","is-referenced-by-count":29,"title":["Complexity of Compact Proofreading for Self-assembled Patterns"],"prefix":"10.1007","author":[{"given":"David","family":"Soloveichik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik","family":"Winfree","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"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: ACM Symposium on Theory of Computing (STOC), pp. 740\u2013748 (2001)","key":"24_CR1","DOI":"10.1145\/380752.380881"},{"unstructured":"Aggarwal, G., Goldwasser, M., Kao, M., Schweller, R.T.: Complexities for generalized models of self-assembly. In: Symposium on Discrete Algorithms (SODA), pp. 880\u2013889 (2004)","key":"24_CR2"},{"doi-asserted-by":"crossref","unstructured":"Barish, R.D., Rothemund, P.W.K., Winfree, E.: Two computational primitives for algorithmic self-assembly: Copying and counting. NanoLetters (to appear)","key":"24_CR3","DOI":"10.1021\/nl052038l"},{"doi-asserted-by":"crossref","unstructured":"Chen, H.-L., Goel, A.: Error free self-assembly using error prone tiles. In: Ferretti, et al. (eds.) [7], pp. 62\u201375","key":"24_CR4","DOI":"10.1007\/11493785_6"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"DNA Computing","year":"2004","unstructured":"Chen, J., Reif, J.H. (eds.): DAN 2003. LNCS, vol.\u00a02943. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Cook, M., Rothemund, P.W.K., Winfree, E.: Self-assembled circuit patterns. In: Chen, Reif (eds.) [5], pp. 91\u2013107","key":"24_CR6","DOI":"10.1007\/978-3-540-24628-2_11"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"DNA Computing","year":"2005","unstructured":"Ferretti, C., Mauri, G., Zandron, C. (eds.): DNA 2004. LNCS, vol.\u00a03384. Springer, Heidelberg (2005)"},{"unstructured":"Rothemund, P.W.K.: Theory and Experiments in Algorithmic Self-Assembly. PhD thesis, University of Southern California, Los Angeles (2001)","key":"24_CR8"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1371\/journal.pbio.0020424","volume":"2","author":"P.W.K. Rothemund","year":"2004","unstructured":"Rothemund, P.W.K., Papakakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biology\u00a02, e424 (2004)","journal-title":"PLoS Biology"},{"doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares. In: ACM Symposium on Theory of Computing (STOC), pp. 459\u2013468 (2000)","key":"24_CR10","DOI":"10.1145\/335305.335358"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1017\/S0143385700006738","volume":"12","author":"L. Hurd","year":"1992","unstructured":"Hurd, L., Kari, J., Culik, K.: The topological entropy of cellular automata is uncomputable. Ergodic Theory Dynamical Systems\u00a012, 255\u2013265 (1992)","journal-title":"Ergodic Theory Dynamical Systems"},{"key":"24_CR12","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. Journal of the Americal Chemical Society\u00a0122, 1848\u20131860 (2000)","journal-title":"Journal of the Americal Chemical Society"},{"key":"24_CR13","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-24719-7_21","volume-title":"Computational Methods for SNPs and Haplotype Inference","author":"M.G. Lagoudakis","year":"2004","unstructured":"Lagoudakis, M.G., LaBean, T.H.: 2-D DNA self-assembly for satisfiability. In: Istrail, S., Waterman, M.S., Clark, A. (eds.) DIMACS\/RECOMB Satellite Workshop 2002. LNCS (LNBI), vol.\u00a02983, pp. 141\u2013154. Springer, Heidelberg (2004)"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1038\/35035038","volume":"407","author":"C. Mao","year":"2000","unstructured":"Mao, C., LaBean, T.H., Reif, J.H., Seeman, N.C.: Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature\u00a0407, 493\u2013496 (2000)","journal-title":"Nature"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"5437","DOI":"10.1021\/ja9900398","volume":"121","author":"C. Mao","year":"1999","unstructured":"Mao, C., Sun, W., Seeman, N.C.: Designed two-dimensional DNA holliday junction arrays visualized by atomic force microscopy. Journal of the Americal Chemical Society\u00a0121, 5437\u20135443 (1999)","journal-title":"Journal of the Americal Chemical Society"},{"key":"24_CR16","series-title":"DIMACS","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1090\/dimacs\/048\/17","volume-title":"DNA Based Computers III","author":"J. Reif","year":"1999","unstructured":"Reif, J.: Local parallel biomolecular computing. In: DNA Based Computers III. DIMACS, vol.\u00a048, pp. 217\u2013254. American Mathematical Society, Providence (1999)"},{"doi-asserted-by":"crossref","unstructured":"Reif, J.H., Sahu, S., Yin, P.: Compact error-resilient computational DNA tiling assemblies. In: Ferretti, et al. (eds.) [7], pp. 293\u2013307","key":"24_CR17","DOI":"10.1007\/11493785_26"},{"doi-asserted-by":"crossref","unstructured":"Schulman, R., Winfree, E.: Programmable control of nucleation for algorithmic self-assembly. In: Ferretti, et al. (eds.) [7], pp. 319\u2013328","key":"24_CR18","DOI":"10.1007\/11493785_28"},{"key":"24_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1007\/11553090_74","volume-title":"Advances in Artificial Life","author":"R. Schulman","year":"2005","unstructured":"Schulman, R., Winfree, E.: Self-replication and evolution of DNA crystals. In: Capcarr\u00e8re, M.S., Freitas, A.A., Bentley, P.J., Johnson, C.G., Timmis, J. (eds.) ECAL 2005. LNCS (LNAI), vol.\u00a03630, pp. 734\u2013743. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes (2005) (extended abstract); Preprint of the full paper is cs.CC\/0412096 on arXiv.org","key":"24_CR20","DOI":"10.1007\/11493785_30"},{"key":"24_CR21","series-title":"DIMACS","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1090\/dimacs\/027\/09","volume-title":"DNA Based Computers","author":"E. Winfree","year":"1996","unstructured":"Winfree, E.: On the computational power of DNA annealing and ligation. In: Lipton, R.J., Baum, E.B. (eds.) DNA Based Computers. DIMACS, vol.\u00a027, pp. 199\u2013221. American Mathematical Society, Providence (1996)"},{"unstructured":"Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology, Pasadena (1998)","key":"24_CR22"},{"unstructured":"Winfree, E.: Simulations of computing by self-assembly. Technical Report CS-TR:1998.22, Caltech (1998)","key":"24_CR23"},{"doi-asserted-by":"crossref","unstructured":"Winfree, E., Bekbolatov, R.: Proofreading tile sets: Error-correction for algorithmic self-assembly. In: Chen, Reif (eds.) [5], pp. 126\u2013144","key":"24_CR24","DOI":"10.1007\/978-3-540-24628-2_13"},{"key":"24_CR25","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":"24_CR26","series-title":"DIMACS","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1090\/dimacs\/044\/16","volume-title":"DNA Based Computers II","author":"E. Winfree","year":"1998","unstructured":"Winfree, E., Yang, X., Seeman, N.C.: Universal Computation via Self-assembly of DNA: Some Theory and Experiments. In: Landweber, L.F., Baum, E.B. (eds.) DNA Based Computers II. DIMACS, vol.\u00a044, pp. 191\u2013213. American Mathematical Society, Providence (1998)"}],"container-title":["Lecture Notes in Computer Science","DNA Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753681_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T09:17:40Z","timestamp":1555751860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753681_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341611","9783540341659"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11753681_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}