{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:52Z","timestamp":1773376972115,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Union","doi-asserted-by":"publisher","award":["101045114,101115134"],"award-info":[{"award-number":["101045114,101115134"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF2212437"],"award-info":[{"award-number":["CCF2212437"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195699","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Complex DNA Synthesis Sequences"],"prefix":"10.1109","author":[{"given":"Boaz","family":"Moav","sequence":"first","affiliation":[{"name":"Technion,Computer Science,Haifa,Israel"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Technion,Computer Science,Haifa,Israel"}]},{"given":"Ryan","family":"Gabrys","sequence":"additional","affiliation":[{"name":"CalIT2, UCSD,San Diego,California,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-05188-1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2961265"},{"key":"ref5","article-title":"Clustering billions of reads for DNA data storage","volume-title":"Advances in Neural Information Processing Systems","volume":"30","author":"Rashtchian","year":"2017"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-18681-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.2918"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-19148-3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174272"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITW61385.2024.10807020"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206609"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2024.3401583"},{"key":"ref13","volume-title":"Multivariate analytic combinatorics for cost constrained channels and subsequence enumeration","author":"Lenz","year":"2021"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT63088.2025.11195699","volume-title":"Complex DNA synthesis sequences","author":"Moav","year":"2025"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3390\/e26121028"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3184903"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s41870-023-01169-y"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206892"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619131"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ITW61385.2024.10806998"},{"key":"ref21","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1965","journal-title":"Soviet physics. Doklady"},{"issue":"1","key":"ref22","first-page":"123","article-title":"Tight bounds on the number of string subsequences","volume":"1","author":"Hirschberg","year":"2000","journal-title":"Journal of Discrete Algorithms"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934067"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195699.pdf?arnumber=11195699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:41Z","timestamp":1773347381000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195699\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195699","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}