{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:53:27Z","timestamp":1773377607575,"version":"3.50.1"},"reference-count":49,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSF","doi-asserted-by":"publisher","award":["DMS 1811724"],"award-info":[{"award-number":["DMS 1811724"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007486","name":"SEAS","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007486","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517820","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"1949-1954","source":"Crossref","is-referenced-by-count":5,"title":["Batch Optimization for DNA Synthesis"],"prefix":"10.1109","author":[{"given":"Konstantin","family":"Makarychev","sequence":"first","affiliation":[{"name":"Northwestern University,Evanston,IL,USA,60208"}]},{"given":"Mikl\u00f3s Z.","family":"R\u00e1cz","sequence":"additional","affiliation":[{"name":"Princeton University,Princeton,NJ,USA,08544"}]},{"given":"Cyrus","family":"Rashtchian","sequence":"additional","affiliation":[{"name":"University of California, San Diego,La Jolla,CA,USA,92093"}]},{"given":"Sergey","family":"Yekhanin","sequence":"additional","affiliation":[{"name":"Microsoft Research,Redmond,WA,USA,98052"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174272"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979223842X"},{"key":"ref33","first-page":"113","article-title":"Fidelity Probes for DNA Arrays","author":"hubbell","year":"0","journal-title":"Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1080\/02564602.2014.959078"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-010-9329-3"},{"key":"ref30","first-page":"45","article-title":"Fast Local-Search-based Parallel Algorithms for DNA Probe Placement on Small Oligonucleotide Arrays","volume":"12","author":"trinca","year":"2010","journal-title":"Advanced Modeling and Optimization"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(81)90075-X","article-title":"The shortest common supersequence problem over binary alphabet is NP-complete","volume":"16","author":"r\u00e4ih\u00e4","year":"1981","journal-title":"Theoretical Computer Science"},{"key":"ref36","article-title":"Error and quality control coding for DNA microarrays","author":"milenkovic","year":"2006","journal-title":"the Inaugural Workshop Center for Information Theory and Application"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1089\/10665270252833163"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.4.529"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/11780441_15"},{"key":"ref27","first-page":"89","article-title":"The distribution and deposition algorithm for multiple oligo nucleotide arrays","volume":"17","author":"ning","year":"2006","journal-title":"Genome Informatics"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/VDAT.2010.5496742"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref1","first-page":"1","article-title":"On the molecular memory systems and the directed mutations","author":"neiman","year":"1965","journal-title":"Radiotekhnika"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.29"},{"key":"ref22","author":"makarychev","year":"2020","journal-title":"Batch Optimization for DNA Synthesis"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.4171\/MSL\/16"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45784-4_34"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45713-5_1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1089\/1066527041410391"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg1073"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/s41576-019-0125-3"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1038\/s41596-019-0244-5","article-title":"Reading and writing digital data in DNA","volume":"15","author":"meiser","year":"2020","journal-title":"Nature Protocols"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1038\/s41587-019-0240-x"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.2918"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-18681-5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053441"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1038\/nrg3296"},{"key":"ref16","first-page":"3360","article-title":"Clustering Billions of Reads for DNA Data Storage","author":"rashtchian","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref17","first-page":"910","article-title":"Reconstructing strings from random traces","author":"batu","year":"0","journal-title":"Proc 17th Ann ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref18","first-page":"389","article-title":"Trace reconstruction with constant deletion probability and related results","author":"holenstein","year":"2008","journal-title":"SODA"},{"key":"ref19","first-page":"399","article-title":"Improved string reconstruction over insertion-deletion channels","author":"viswanathan","year":"0","journal-title":"Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1038\/nature11875","article-title":"Towards practical, high-capacity, low-maintenance information storage in synthesized DNA","volume":"494","author":"goldman","year":"2013","journal-title":"Nature"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1038\/nature23017","article-title":"CRISPR-Cas encoding of a digital movie into the genomes of a population of living bacteria","volume":"547","author":"shipman","year":"2017","journal-title":"Nature"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2872362.2872397"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1126\/science.aaj2038","article-title":"DNA Fountain enables a robust and efficient storage architecture","volume":"355","author":"erlich","year":"2017","journal-title":"Science"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"5011","DOI":"10.1038\/s41598-017-05188-1","article-title":"Portable and error-free DNA-based data storage","volume":"7","author":"yazdi","year":"2017","journal-title":"Scientific Reports"},{"key":"ref49","author":"bukh","year":"2019","journal-title":"Periodic words common subsequences and frogs"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2004.10.012"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1214\/16-ECP4029"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516519"},{"key":"ref42","author":"jain","year":"2020","journal-title":"Coding for Optimized Writing Rate in DNA Storage"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-10258-1"},{"key":"ref44","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1002\/rsa.3240060408","article-title":"Upper bounds for the expected length of a longest common subsequence of two binary sequences","volume":"6","author":"dan?\u00edk","year":"1995","journal-title":"Random Structures & Algorithms"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1017\/S0021900200047999"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517820.pdf?arnumber=9517820","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:33Z","timestamp":1773347673000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517820\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517820","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}