{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:00:09Z","timestamp":1780444809303,"version":"3.54.1"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1109\/tit.2023.3286694","type":"journal-article","created":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T17:55:46Z","timestamp":1687197346000},"page":"6941-6955","source":"Crossref","is-referenced-by-count":12,"title":["Optimal Reference for DNA Synthesis"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8551-1592","authenticated-orcid":false,"given":"Ohad","family":"Elishco","sequence":"first","affiliation":[{"name":"School of Electrical and Computer Engineering, Ben-Gurion University, Beer Sheva, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7500-1911","authenticated-orcid":false,"given":"Wasim","family":"Huleihel","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Tel-Aviv University, Tel Aviv, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/s41587-019-0240-x"},{"key":"ref2","first-page":"910","article-title":"Reconstructing strings from random traces","volume-title":"Proc. 15th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Batu"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2954679.2872397"},{"key":"ref4","article-title":"Periodic words, common subsequences and frogs","author":"Bukh","year":"2019","journal-title":"arXiv:1912.03510"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053441"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S0001867800045833"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.4.529"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060408"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45713-5_1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.4171\/msl\/16"},{"key":"ref12","first-page":"389","article-title":"Trace reconstruction with constant deletion probability and related results","volume-title":"Proc. 9th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Holenstein"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/16-ecp4029"},{"key":"ref14","first-page":"113","article-title":"Fidelity probes for DNA arrays","volume-title":"Proc. Int. Conf. Intell. Syst. Mol. Biol.","author":"Hubbell"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2980036"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174253"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056939"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45784-4_34"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1089\/1066527041410391"},{"key":"ref20","first-page":"115","article-title":"The discrete noiseless channel revisited","volume-title":"Coding, Communications, and Broadcasting","author":"Khandekar"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24698-5_34"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.2918"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/VDAT.2010.5496742"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-10258-1"},{"key":"ref25","article-title":"Multivariate analytic combinatorics for cost constrained channels and subsequence enumeration","author":"Lenz","year":"2021","journal-title":"arXiv:2111.06105"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174272"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511626302"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516519"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3184903"},{"key":"ref30","first-page":"1635","article-title":"Constrained systems and coding for recording channels","volume-title":"Handbook of Coding Theory","volume":"2","author":"Marcus","year":"1998"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173931"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3066430"},{"issue":"2","key":"ref34","first-page":"89","article-title":"The distribution and deposition algorithm for multiple oligo nucleotide arrays","volume":"17","author":"Ning","year":"2006","journal-title":"Genome Informat."},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-010-9329-3"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.29"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg1073"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/11780441_15"},{"key":"ref40","first-page":"1","article-title":"Clustering billions of reads for DNA data storage","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Rashtchian"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2013-14-5-r51"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611362"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1080\/02564602.2014.959078"},{"key":"ref45","first-page":"399","article-title":"Improved string reconstruction over insertion-deletion channels","volume-title":"Proc. 19th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Viswanathan"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5775-2"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10288603\/10155240.pdf?arnumber=10155240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T02:16:59Z","timestamp":1705025819000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10155240\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11]]},"references-count":46,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2023.3286694","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11]]}}}