乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:21:14Z","timestamp":1725862874594},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319439938"},{"type":"electronic","value":"9783319439945"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-43994-5_7","type":"book-chapter","created":{"date-parts":[[2016,8,13]],"date-time":"2016-08-13T09:34:57Z","timestamp":1471080897000},"page":"98-113","source":"Crossref","is-referenced-by-count":6,"title":["Resiliency to Multiple Nucleation in Temperature-1 Self-Assembly"],"prefix":"10.1007","author":[{"given":"Matthew J.","family":"Patitz","sequence":"first","affiliation":[]},{"given":"Trent A.","family":"Rogers","sequence":"additional","affiliation":[]},{"given":"Robert T.","family":"Schweller","sequence":"additional","affiliation":[]},{"given":"Scott M.","family":"Summers","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Winslow","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,14]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L., Cheng, Q., Goel, A., Huang, M.-D.: Running time and program size for self-assembled squares. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pp. 740\u2013748 (2001)","DOI":"10.1145\/380752.380881"},{"issue":"15","key":"7_CR2","doi-asserted-by":"crossref","first-page":"6054","DOI":"10.1073\/pnas.0808736106","volume":"106","author":"RD 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. 106(15), 6054\u20136059 (2009)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"7_CR3","first-page":"1","volume":"66","author":"R Berger","year":"1966","unstructured":"Berger, R.: The undecidability of the domino problem. Mem. Am. Math. Soc. 66, 1\u201372 (1966)","journal-title":"Mem. Am. Math. Soc."},{"key":"7_CR4","unstructured":"Cannon, S., Demaine, E.D., Demaine, M.L., Eisenstat, S., Patitz, M.J., Schweller, R., Summers, S.M., Winslow, A.: Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM. In: Proceedings of 30th International Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol. 20, pp. 172\u2013184. Schloss Dagstuhl (2013)"},{"key":"7_CR5","unstructured":"Chen, H.-L., Doty, D., Manuch, J., Rafiey, A., Stacho, L.: Pattern overlap implies runaway growth in hierarchical tile systems. In: Arge, L., Pach, J. (eds.) 31st International Symposium on Computational Geometry (SoCG). LIPIcs, vol. 34, pp. 360\u2013373. Schloss Dagstuhl (2015)"},{"issue":"9","key":"7_CR6","doi-asserted-by":"crossref","first-page":"2913","DOI":"10.1021\/nl070793o","volume":"7","author":"H-L Chen","year":"2007","unstructured":"Chen, H.-L., Schulman, R., Goel, A., Winfree, E.: Reducing facet nucleation during algorithmic self-assembly. Nano Lett. 7(9), 2913\u20132919 (2007)","journal-title":"Nano Lett."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Cook, M., Fu, Y., Schweller, R.T.: Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D. In: Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 570\u2013589 (2011)","DOI":"10.1137\/1.9781611973082.45"},{"issue":"3","key":"7_CR8","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s11047-008-9073-0","volume":"7","author":"ED 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":"1","key":"7_CR9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s11047-015-9517-2","volume":"15","author":"D Doty","year":"2016","unstructured":"Doty, D.: Producibility in hierarchical self-assembly. Nat. Comput. 15(1), 41\u201349 (2016)","journal-title":"Nat. Comput."},{"key":"7_CR10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.tcs.2010.08.023","volume":"412","author":"D Doty","year":"2011","unstructured":"Doty, D., Patitz, M.J., Summers, S.M.: Limitations of self-assembly at temperature 1. Theor. Comput. Sci. 412, 145\u2013158 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Hendricks, J., Patitz, M.J., Rogers, T.A., Schweller, R.T.: Universal computation with arbitrary polyomino tiles in non-cooperative self-assembly. In: Proceedings of the 25th ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pp. 148\u2013167. SIAM (2015)","DOI":"10.1137\/1.9781611973730.12"},{"key":"7_CR12","unstructured":"Goodman-Strauss, C.: Open questions in tiling (2000). http:\/\/comp.uark.edu\/strauss\/papers\/survey.pdf"},{"key":"7_CR13","volume-title":"Tilings and Patterns","author":"B Gr\u00fcnbaum","year":"1987","unstructured":"Gr\u00fcnbaum, B., Shephard, G.C.: Tilings and Patterns. W.H. Freeman and Company, New York (1987)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Meunier, P.-E., Patitz, M.J., Summers, S.M., Theyssier, G., Woods, D.: Intrinsic universality in tile self-assembly requires cooperation. In: Proceedings of the 25th Symposium on Discrete Algorithms (SODA), pp. 752\u2013771 (2014)","DOI":"10.1137\/1.9781611973402.56"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/978-3-642-39074-6_17","volume-title":"Unconventional Computation and Natural Computation","author":"JE Padilla","year":"2013","unstructured":"Padilla, J.E., et al.: Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes. In: Mauri, G., Dennunzio, A., Manzoni, L., Porreca, A.E. (eds.) UCNC 2013. LNCS, vol. 7956, pp. 174\u2013185. Springer, Heidelberg (2013)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-642-23638-9_15","volume-title":"DNA Computing and Molecular Programming","author":"MJ Patitz","year":"2011","unstructured":"Patitz, M.J., Schweller, R.T., Summers, S.M.: Exact shapes and turing universality at temperature 1 with a single negative glue. In: Cardelli, L., Shih, W. (eds.) DNA 17 2011. LNCS, vol. 6937, pp. 175\u2013189. Springer, Heidelberg (2011)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"key":"7_CR18","unstructured":"Schulman, R.: The self-replication and evolution of DNA crystals. PhD thesis (2007)"},{"issue":"39","key":"7_CR19","doi-asserted-by":"crossref","first-page":"15236","DOI":"10.1073\/pnas.0701467104","volume":"104","author":"R Schulman","year":"2007","unstructured":"Schulman, R., Winfree, E.: Synthesis of crystals with a programmable kinetic barrier to nucleation. Proc. Natl. Acad. Sci. 104(39), 15236\u201315241 (2007)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4","key":"7_CR20","doi-asserted-by":"crossref","first-page":"1581","DOI":"10.1137\/070680266","volume":"39","author":"R Schulman","year":"2009","unstructured":"Schulman, R., Winfree, E.: Programmable control of nucleation for algorithmic self-assembly. SIAM J. Comput. 39(4), 1581\u20131616 (2009)","journal-title":"SIAM J. Comput."},{"key":"7_CR21","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0022-5193(82)90002-9","volume":"99","author":"NC 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":"8","key":"7_CR22","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.1016\/j.jcta.2011.05.001","volume":"118","author":"JES Socolar","year":"2011","unstructured":"Socolar, J.E.S., Taylor, J.M.: An aperiodic hexagonal tile. J. Comb. Theor. Series A 118(8), 2207\u20132231 (2011)","journal-title":"J. Comb. Theor. Series A"},{"issue":"6","key":"7_CR23","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":"7_CR24","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. PhD thesis, Caltech (1998)"}],"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-319-43994-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T20:40:44Z","timestamp":1498336844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-43994-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319439938","9783319439945"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43994-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}