{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:24Z","timestamp":1773377064492,"version":"3.50.1"},"reference-count":29,"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 Commission","doi-asserted-by":"publisher","award":["101045114"],"award-info":[{"award-number":["101045114"]}],"id":[{"id":"10.13039\/501100000780","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.11195425","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":0,"title":["The Coverage Depth Problem in Dna Storage Over Small Alphabets"],"prefix":"10.1109","author":[{"given":"Matteo","family":"Bertuzzo","sequence":"first","affiliation":[{"name":"Eindhoven University of Technology,Dept. of Mathematics and Computer Science,the Netherlands"}]},{"given":"Alberto","family":"Ravagnani","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology,Dept. of Mathematics and Computer Science,the Netherlands"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Technion-Israel Institute of Technology,Faculty of Computer Science,Israel"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Worldwide idc global datasphere forecast, 2022\u20132026: Enterprise organizations driving most of the data growth","author":"Rydning","year":"2022","journal-title":"tech. rep., Technical Report"},{"key":"ref2","author":"Data","year":"2021","journal-title":"Preserving our digital legacy: an introduction to DNA data storage"},{"key":"ref3","article-title":"Biology is all you need","volume-title":"The International Conference for High Performance Computing, Networking, Storage, and Analysis","author":"Markowitz","year":"2023"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/srep14138"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.05.398"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2872362.2872397"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-05188-1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/s41587-019-0240-x"},{"key":"ref10","article-title":"Deep DNA storage: Scalable and robust DNA storage via coding theory and deep learning","author":"Bar-Lev","year":"2021","journal-title":"arXiv preprint"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537305"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1561\/0100000117"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-45832-6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3496587"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2307\/2308930"},{"issue":"1","key":"ref16","first-page":"215","article-title":"On a classical problem of probability theory","volume":"6","author":"Erd\u00f6s","year":"1961","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl"},{"key":"ref17","volume-title":"An introduction to probability theory and its applications","volume":"1","author":"Feller","year":"1968"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90177-C"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2024.3408053"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/tcomm.2024.3506938"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-58386-z"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619348"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619151"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF02410779"},{"key":"ref25","volume-title":"The theory of error-correcting codes","volume":"16","author":"MacWilliams","year":"1977"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.4171\/JEMS\/316"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9658-6"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0436-3"},{"key":"ref29","volume-title":"Asymptotic Methods in Analysis","volume":"4","author":"De Bruijn","year":"1981"}],"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\/11195425.pdf?arnumber=11195425","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:26Z","timestamp":1773347426000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195425\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195425","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}