{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T07:41:10Z","timestamp":1771573270995,"version":"3.50.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030000295","type":"print"},{"value":"9783030000301","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-00030-1_3","type":"book-chapter","created":{"date-parts":[[2018,9,6]],"date-time":"2018-09-06T19:44:00Z","timestamp":1536263040000},"page":"37-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing Tile Set Size While Preserving Proofreading with a DNA Self-assembly Compiler"],"prefix":"10.1007","author":[{"given":"Constantine G.","family":"Evans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik","family":"Winfree","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,7]]},"reference":[{"key":"3_CR1","unstructured":"Alhambra. https:\/\/github.com\/DNA-and-Natural-Algorithms-Group\/alhambra"},{"issue":"15","key":"3_CR2","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.K., Winfree, E.: An information-bearing seed for nucleating algorithmic self-assembly. PNAS 106(15), 6054\u20136059 (2009). https:\/\/doi.org\/10.1073\/pnas.0808736106","journal-title":"PNAS"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Cannon, S., et al.: Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM. In: Portier, N., Wilke, T. (eds.) STACS 2013. LIPIcs, vol. 20, pp. 172\u2013184. Dagstuhl (2013). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2013.172","DOI":"10.4230\/LIPIcs.STACS.2013.172"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/11493785_6","volume-title":"DNA Computing","author":"H-L Chen","year":"2005","unstructured":"Chen, H.-L., Goel, A.: Error free self-assembly using error prone tiles. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 62\u201375. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11493785_6"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"2913","DOI":"10.1021\/nl070793o","volume":"7","author":"HL Chen","year":"2007","unstructured":"Chen, H.L., Schulman, R., Goel, A., Winfree, E.: Reducing facet nucleation during algorithmic self-assembly. Nano Lett. 7, 2913\u20132919 (2007). https:\/\/doi.org\/10.1021\/nl070793o","journal-title":"Nano Lett."},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2013.05.009","volume":"499","author":"E Czeizler","year":"2018","unstructured":"Czeizler, E., Popa, A.: Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly. Theor. Comput. Sci. 499, 23\u201337 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2013.05.009","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"3_CR7","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2380656.2380675","volume":"55","author":"D Doty","year":"2012","unstructured":"Doty, D.: Theory of algorithmic self-assembly. Commun. ACM 55(12), 78\u201388 (2012). https:\/\/doi.org\/10.1145\/2380656.2380675","journal-title":"Commun. ACM"},{"issue":"1\u20132","key":"3_CR8","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(1\u20132), 145\u2013158 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.08.023","journal-title":"Theor. Comput. Sci."},{"key":"3_CR9","unstructured":"Evans, C.G.: Crystals that count! Physical principles and experimental investigations of DNA tile self-assembly. Ph.D. thesis, California Institute of Technology (2014). http:\/\/resolver.caltech.edu\/CaltechTHESIS:05132014-142306756"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-01928-4_5","volume-title":"DNA Computing and Molecular Programming","author":"CG Evans","year":"2013","unstructured":"Evans, C.G., Winfree, E.: DNA sticky end design and assignment for robust algorithmic self-assembly. In: Soloveichik, D., Yurke, B. (eds.) DNA 2013. LNCS, vol. 8141, pp. 61\u201375. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-01928-4_5"},{"issue":"12","key":"3_CR11","doi-asserted-by":"publisher","first-page":"3808","DOI":"10.1039\/C6CS00745G","volume":"46","author":"CG Evans","year":"2017","unstructured":"Evans, C.G., Winfree, E.: Physical principles for DNA tile self-assembly. Chem. Soc. Rev. 46(12), 3808\u20133829 (2017). https:\/\/doi.org\/10.1039\/C6CS00745G","journal-title":"Chem. Soc. Rev."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"3211","DOI":"10.1021\/bi00064a003","volume":"32","author":"TJ Fu","year":"1993","unstructured":"Fu, T.J., Seeman, N.C.: DNA double-crossover molecules. Biochemistry 32, 3211\u20133220 (1993). https:\/\/doi.org\/10.1021\/bi00064a003","journal-title":"Biochemistry"},{"issue":"7","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1791","DOI":"10.1021\/nl0722830","volume":"8","author":"K Fujibayashi","year":"2008","unstructured":"Fujibayashi, K., Hariadi, R., Park, S.H., Winfree, E., Murata, S.: Toward reliable algorithmic self-assembly of DNA tiles: a fixed-width cellular automaton pattern. Nano Lett. 8(7), 1791\u20131797 (2008). https:\/\/doi.org\/10.1021\/nl0722830","journal-title":"Nano Lett."},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.jcss.2013.08.003","volume":"80","author":"M G\u00f6\u00f6s","year":"2014","unstructured":"G\u00f6\u00f6s, M., Lempi\u00e4inen, T., Czeizler, E., Orponen, P.: Search methods for tile sets in patterned DNA self-assembly. J. Comput. Syst. Sci. 80(1), 297\u2013319 (2014). https:\/\/doi.org\/10.1016\/j.jcss.2013.08.003","journal-title":"J. Comput. Syst. Sci."},{"issue":"20","key":"3_CR15","doi-asserted-by":"publisher","first-page":"6313","DOI":"10.1073\/pnas.1502210112","volume":"112","author":"WM Jacobs","year":"2015","unstructured":"Jacobs, W.M., Reinhardt, A., Frenkel, D.: Rational design of self-assembly pathways for complex multicomponent structures. PNAS 112(20), 6313\u20136318 (2015). https:\/\/doi.org\/10.1073\/pnas.1502210112","journal-title":"PNAS"},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/s10878-015-9975-6","volume":"33","author":"A Johnsen","year":"2017","unstructured":"Johnsen, A., Kao, M.Y., Seki, S.: A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis. J. Comb. Optim. 33(2), 496\u2013529 (2017). https:\/\/doi.org\/10.1007\/s10878-015-9975-6","journal-title":"J. Comb. Optim."},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/978-3-642-45030-3_65","volume-title":"Algorithms and Computation","author":"AC Johnsen","year":"2013","unstructured":"Johnsen, A.C., Kao, M.-Y., Seki, S.: Computing minimum tile sets to self-assemble color patterns. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 699\u2013710. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45030-3_65"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Johnson, R., Dong, Q., Winfree, E.: Verifying chemical reaction network implementations: a bisimulation approach. Theor. Comput. Sci. (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.01.002","DOI":"10.1016\/j.tcs.2018.01.002"},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-016-0154-7","volume":"78","author":"L Kari","year":"2017","unstructured":"Kari, L., Kopecki, S., Meunier, P.\u00c9., Patitz, M.J., Seki, S.: Binary pattern tile set synthesis is NP-hard. Algorithmica 78(1), 1\u201346 (2017). https:\/\/doi.org\/10.1007\/s00453-016-0154-7","journal-title":"Algorithmica"},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s11047-014-9434-9","volume":"14","author":"L Kari","year":"2015","unstructured":"Kari, L., Kopecki, S., Seki, S.: 3-color bounded patterned self-assembly. Nat. Comput. 14(2), 279\u2013292 (2015). https:\/\/doi.org\/10.1007\/s11047-014-9434-9","journal-title":"Nat. Comput."},{"issue":"6111","key":"3_CR21","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1126\/science.1227268","volume":"338","author":"Y Ke","year":"2012","unstructured":"Ke, Y., Ong, L.L., Shih, W.M., Yin, P.: Three-dimensional structures self-assembled from DNA bricks. Science 338(6111), 1177\u20131183 (2012). https:\/\/doi.org\/10.1126\/science.1227268","journal-title":"Science"},{"issue":"8","key":"3_CR22","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1002\/cphc.200600260","volume":"7","author":"C Lin","year":"2006","unstructured":"Lin, C., Liu, Y., Rinker, S., Yan, H.: DNA tile based self-assembly: building complex nanoarchitectures. ChemPhysChem 7(8), 1641\u20131647 (2006). https:\/\/doi.org\/10.1002\/cphc.200600260","journal-title":"ChemPhysChem"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Ma, X., Lombardi, F.: Combinatorial optimization problem in designing DNA self-assembly tile sets. In: 2008 IEEE International Workshop on Design and Test of Nano Devices, Circuits and Systems, pp. 73\u201376 (2008). https:\/\/doi.org\/10.1109\/NDCS.2008.7","DOI":"10.1109\/NDCS.2008.7"},{"issue":"5","key":"3_CR24","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 Trans. Comput.-Aided Des. Integr. Circ. Syst. 27(5), 963\u2013967 (2008). https:\/\/doi.org\/10.1109\/TCAD.2008.917973","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst."},{"key":"3_CR25","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Upper Saddle River (1989)"},{"issue":"7683","key":"3_CR26","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1038\/nature24648","volume":"552","author":"LL Ong","year":"2017","unstructured":"Ong, L.L., et al.: Programmable self-assembly of three-dimensional nanostructures from 10,000 unique components. Nature 552(7683), 72\u201377 (2017). https:\/\/doi.org\/10.1038\/nature24648","journal-title":"Nature"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/11493785_26","volume-title":"DNA Computing","author":"JH Reif","year":"2005","unstructured":"Reif, J.H., Sahu, S., Yin, P.: Compact error-resilient computational DNA tiling assemblies. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 293\u2013307. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11493785_26"},{"issue":"4","key":"3_CR28","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1137\/070680266","volume":"39","author":"R Schulman","year":"2010","unstructured":"Schulman, R., Winfree, E.: Programmable control of nucleation for algorithmic self-assembly. SIAM J. Comput. 39(4), 1581\u20131616 (2010). https:\/\/doi.org\/10.1137\/070680266","journal-title":"SIAM J. Comput."},{"issue":"17","key":"3_CR29","doi-asserted-by":"publisher","first-page":"6405","DOI":"10.1073\/pnas.1117813109","volume":"109","author":"R Schulman","year":"2012","unstructured":"Schulman, R., Yurke, B., Winfree, E.: Robust self-replication of combinatorial information via crystal growth and scission. PNAS 109(17), 6405\u20136410 (2012). https:\/\/doi.org\/10.1073\/pnas.1117813109","journal-title":"PNAS"},{"key":"3_CR30","doi-asserted-by":"publisher","first-page":"17068","DOI":"10.1038\/natrevmats.2017.68","volume":"3","author":"NC Seeman","year":"2017","unstructured":"Seeman, N.C., Sleiman, H.F.: DNA nanotechnology. Nat. Rev. Mater. 3, 17068 (2017). https:\/\/doi.org\/10.1038\/natrevmats.2017.68","journal-title":"Nat. Rev. Mater."},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/11753681_24","volume-title":"DNA Computing","author":"D Soloveichik","year":"2006","unstructured":"Soloveichik, D., Winfree, E.: Complexity of compact proofreading for self-assembled patterns. In: Carbone, A., Pierce, N.A. (eds.) DNA 2005. LNCS, vol. 3892, pp. 305\u2013324. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11753681_24"},{"issue":"16","key":"3_CR32","doi-asserted-by":"publisher","first-page":"7989","DOI":"10.1093\/nar\/gkw670","volume":"44","author":"W Wang","year":"2016","unstructured":"Wang, W., Lin, T., Zhang, S., Bai, T., Mi, Y., Wei, B.: Self-assembly of fully addressable DNA nanostructures from double crossover tiles. Nucleic Acids Res. 44(16), 7989\u20137996 (2016). https:\/\/doi.org\/10.1093\/nar\/gkw670","journal-title":"Nucleic Acids Res."},{"issue":"7400","key":"3_CR33","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1038\/nature11075","volume":"485","author":"B Wei","year":"2012","unstructured":"Wei, B., Dai, M., Yin, P.: Complex shapes self-assembled from single-stranded DNA tiles. Nature 485(7400), 623\u2013626 (2012). https:\/\/doi.org\/10.1038\/nature11075","journal-title":"Nature"},{"key":"3_CR34","doi-asserted-by":"publisher","unstructured":"Winfree, E.: Simulations of computing by self-assembly. Technical report, CaltechCSTR:1998.22, Pasadena, CA (1998). https:\/\/doi.org\/10.7907\/Z9TB14X7","DOI":"10.7907\/Z9TB14X7"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-24628-2_13","volume-title":"DNA Computing","author":"E Winfree","year":"2004","unstructured":"Winfree, E., Bekbolatov, R.: Proofreading tile sets: error correction for algorithmic self-assembly. In: Chen, J., Reif, J. (eds.) DNA 2003. LNCS, vol. 2943, pp. 126\u2013144. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24628-2_13"}],"container-title":["Lecture Notes in Computer Science","DNA Computing and Molecular Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00030-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:42:35Z","timestamp":1709833355000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00030-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030000295","9783030000301"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00030-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 September 2018","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":"Jinan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dna2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dna24sdnu.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}