乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T07:19:47Z","timestamp":1726039187206},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030268060"},{"type":"electronic","value":"9783030268077"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26807-7_6","type":"book-chapter","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T23:18:04Z","timestamp":1564442284000},"page":"100-119","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["New Bounds on the Tile Complexity of Thin Rectangles at Temperature-1"],"prefix":"10.1007","author":[{"given":"David","family":"Furcy","sequence":"first","affiliation":[]},{"given":"Scott M.","family":"Summers","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Wendlandt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Adleman, L.M., Cheng, Q., Goel, A., Huang, M.-D.: Running time and program size for self-assembled squares. In: STOC, pp. 740\u2013748 (2001)","DOI":"10.1145\/380752.380881"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/S0097539704445202","volume":"34","author":"G Aggarwal","year":"2005","unstructured":"Aggarwal, G., Cheng, Q., Goldwasser, M.H., Kao, M.-Y., de Espan\u00e9s, P.M., Schweller, R.T.: Complexities for generalized models of self-assembly. SIAM J. Comput. 34, 1493\u20131515 (2005)","journal-title":"SIAM J. Comput."},{"issue":"15","key":"6_CR3","doi-asserted-by":"publisher","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. Nat. Acad. Sci. 106(15), 6054\u20136059 (2009)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Cook, M., Fu, Y., Schweller, R.: Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (2011)","DOI":"10.1137\/1.9781611973082.45"},{"key":"6_CR5","doi-asserted-by":"publisher","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."},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1007\/s00453-016-0147-6","volume":"77","author":"D Furcy","year":"2017","unstructured":"Furcy, D., Micka, S., Summers, S.M.: Optimal program-size complexity for self-assembled squares at temperature 1 in 3D. Algorithmica 77(4), 1240\u20131282 (2017)","journal-title":"Algorithmica"},{"issue":"6","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1909","DOI":"10.1007\/s00453-016-0260-6","volume":"80","author":"D Furcy","year":"2018","unstructured":"Furcy, D., Summers, S.M.: Optimal self-assembly of finite shapes at temperature 1 in 3D. Algorithmica 80(6), 1909\u20131963 (2018)","journal-title":"Algorithmica"},{"issue":"6","key":"6_CR8","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1089\/cmb.2009.0067","volume":"17","author":"J Manuch","year":"2010","unstructured":"Manuch, J., Stacho, L., Stoll, C.: Two lower bounds for self-assemblies at temperature 1. J. Comput. Biol. 17(6), 841\u2013852 (2010)","journal-title":"J. Comput. Biol."},{"issue":"6803","key":"6_CR9","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1038\/35035038","volume":"407","author":"C Mao","year":"2000","unstructured":"Mao, C., LaBean, T.H., Relf, J.H., Seeman, N.C.: Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature 407(6803), 493\u2013496 (2000)","journal-title":"Nature"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Meunier, P.-E., Patitz, M.J., Summers, S.M., Theyssier, G., Winslow, A., Woods, D.: Intrinsic universality in tile self-assembly requires cooperation. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. pp. 752\u2013771 (2014)","DOI":"10.1137\/1.9781611973402.56"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Meunier, P.-\u00c9., Woods, D.: The non-cooperative tile assembly model is not intrinsically universal or capable of bounded turing machine simulation. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, 19\u201323 June 2017, pp. 328\u2013341 (2017)","DOI":"10.1145\/3055399.3055446"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: STOC 2000: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"issue":"12","key":"6_CR13","doi-asserted-by":"publisher","first-page":"2041","DOI":"10.1371\/journal.pbio.0020424","volume":"2","author":"PWK 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."},{"issue":"39","key":"6_CR14","doi-asserted-by":"publisher","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. Nat. Acad. Sci. 104(39), 15236\u201315241 (2007)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"6_CR15","doi-asserted-by":"publisher","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":"6","key":"6_CR16","doi-asserted-by":"publisher","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":"6_CR17","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. Ph.D. thesis, California Institute of Technology, June 1998"},{"issue":"6693","key":"6_CR18","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 394(6693), 539\u2013544 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","DNA Computing and Molecular Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26807-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T23:26:33Z","timestamp":1564442793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26807-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030268060","9783030268077"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26807-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DNA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on DNA Computing and Molecular Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seattle, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dna2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/misl.cs.washington.edu\/events\/dna25\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}