{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:50:12Z","timestamp":1743108612558,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642236372"},{"type":"electronic","value":"9783642236389"}],"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-23638-9_10","type":"book-chapter","created":{"date-parts":[[2011,9,9]],"date-time":"2011-09-09T17:31:12Z","timestamp":1315589472000},"page":"100-114","source":"Crossref","is-referenced-by-count":12,"title":["One-Dimensional Staged Self-assembly"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarah","family":"Eisenstat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mashhood","family":"Ishaque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Winslow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","first-page":"792","volume-title":"Proceedings of the 34th Annual ACM Symposium on Theory of Computing","author":"M. Charikar","year":"2002","unstructured":"Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Rasala, A., Sahai, A., Shelat, A.: Approximating the smallest grammar: Kolmogorov complexity in natural models. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp. 792\u2013801. ACM, New York (2002)"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11047-008-9073-0","volume":"7","author":"E. Demaine","year":"2008","unstructured":"Demaine, E., Demaine, M., Fekete, S., Ishaque, M., Rafalin, E., Schweller, R., Souvaine, D.: Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues. Natural Computing\u00a07, 347\u2013370 (2008)","journal-title":"Natural Computing"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/PL00009202","volume":"20","author":"M. Farach","year":"1998","unstructured":"Farach, M., Thorup, M.: String matching in Lempel-Ziv compressed strings. Algorithmica\u00a020, 388\u2013404 (1998)","journal-title":"Algorithmica"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-18305-8_7","volume-title":"DNA Computing and Molecular Programming","author":"M. G\u00f6\u00f6s","year":"2011","unstructured":"G\u00f6\u00f6s, M., Orponen, P.: Synthesizing minimal tile sets for patterned dna self-assembly. In: Sakakibara, Y., Mi, Y. (eds.) DNA 16 2010. LNCS, vol.\u00a06518, pp. 71\u201382. Springer, Heidelberg (2011)"},{"key":"10_CR5","unstructured":"Lehman, E.: Approximation Algorithms for Grammar-Based Data Compression. PhD thesis, MIT (2002)"},{"issue":"5","key":"10_CR6","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"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-45452-7_3","volume-title":"Combinatorial Pattern Matching","author":"W. Rytter","year":"2002","unstructured":"Rytter, W.: Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol.\u00a02373, pp. 20\u201331. Springer, Heidelberg (2002), doi:10.1007\/3-540-45452-7_3."},{"issue":"2-4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.jda.2004.08.016","volume":"3","author":"H. Sakamoto","year":"2005","unstructured":"Sakamoto, H.: A fully linear-time approximation algorithm for grammar-based compression. Journal of Discrete Algorithms\u00a03(2-4), 416\u2013430 (2005)","journal-title":"Journal of Discrete Algorithms"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/11493785_30","volume-title":"DNA Computing","author":"D. Soloveichik","year":"2005","unstructured":"Soloveichik, D., Winfree, E.: Complexity of Self-assembled Shapes. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol.\u00a03384, pp. 344\u2013354. Springer, Heidelberg (2005)"},{"key":"10_CR10","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-642-23638-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T08:03:55Z","timestamp":1554192235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23638-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642236372","9783642236389"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23638-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}