{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:28:16Z","timestamp":1767914896875,"version":"3.49.0"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["CCF-2210823"],"award-info":[{"award-number":["CCF-2210823"]}]},{"name":"Simons Investigator Award"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/jsait.2025.3610643","type":"journal-article","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T17:36:16Z","timestamp":1758044176000},"page":"383-393","source":"Crossref","is-referenced-by-count":0,"title":["Geno-Weaving: A Framework for Low-Complexity Capacity-Achieving DNA Data Storage"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2574-1510","authenticated-orcid":false,"given":"Hsin-Po","family":"Wang","sequence":"first","affiliation":[{"name":"University of California, Berkeley, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7926-3396","authenticated-orcid":false,"given":"Venkatesan","family":"Guruswami","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, CA, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1126\/science.7725109"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"issue":"1","key":"ref4","first-page":"14138","article-title":"A rewritable, random-access DNA-based storage system","volume-title":"Sci. Rep.","volume":"5","author":"Tabatabaei Yazdi","year":"2015"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaj2038"},{"issue":"1","key":"ref6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1038\/s41540-022-00233-w","article-title":"Adaptive coding for DNA storage with high storage density and low coverage","volume":"8","author":"Cao","year":"2022","journal-title":"npj Syst. Biol. Appl."},{"issue":"2","key":"ref7","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.tibtech.2023.08.001","article-title":"How close are we to storing data in DNA","volume":"42","author":"Gervasio","year":"2024","journal-title":"Trends Biotechnol."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.xgen.2023.100377"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/cjoc.202401134"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2270273"},{"issue":"6","key":"ref11","doi-asserted-by":"crossref","first-page":"3125","DOI":"10.1109\/TIT.2016.2555321","article-title":"Codes for DNA sequence profiles","volume":"62","author":"Kiah","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2996377"},{"issue":"12","key":"ref13","doi-asserted-by":"crossref","first-page":"7904","DOI":"10.1109\/TIT.2021.3120920","article-title":"Torn-paper coding","volume":"67","author":"Shomorony","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref14","first-page":"1937","article-title":"Capacity of the torn paper channel with lost pieces","volume-title":"Proc. IEEE Int. Symp. Inf. Theory (ISIT)","author":"Ravi"},{"issue":"1","key":"ref15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/JSAIT.2022.3151737","article-title":"Coded shotgun sequencing","volume":"3","author":"Ravi","year":"2022","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2024.3403759"},{"key":"ref17","first-page":"2934","article-title":"Adversarial torn-paper codes","volume-title":"Proc. IEEE Int. Symp. Inf. Theory (ISIT)","author":"Bar-Lev"},{"issue":"1","key":"ref18","doi-asserted-by":"crossref","first-page":"5345","DOI":"10.1038\/s41467-020-19148-3","article-title":"Low cost DNA data storage using photolithographic synthesis and advanced information reconstruction and error correction","volume":"11","author":"Antkowiak","year":"2020","journal-title":"Nature Commun."},{"issue":"3","key":"ref19","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1038\/s41570-022-00456-9","article-title":"DNA synthesis technologies to close the gene writing gap","volume":"7","author":"Hoose","year":"2023","journal-title":"Nature Rev. Chem."},{"key":"ref20","first-page":"2885","article-title":"Coding for efficient DNA synthesis","volume-title":"Proc. IEEE Int. Symp. Inf. Theory (ISIT)","author":"Lenz"},{"key":"ref21","first-page":"585","article-title":"DNA synthesis using shortmers","volume-title":"Proc. IEEE Int. Symp. Inf. Theory (ISIT)","author":"Abu-Sini"},{"key":"ref22","first-page":"352","article-title":"Deletion correcting codes for efficient DNA synthesis","volume-title":"Proc. IEEE Int. Symp.","author":"Chrisnata"},{"issue":"11","key":"ref23","doi-asserted-by":"crossref","first-page":"6941","DOI":"10.1109\/TIT.2023.3286694","article-title":"Optimal reference for DNA synthesis","volume":"69","author":"Elishco","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT57864.2024.10619178","article-title":"On counting subsequences and higher-order Fibonacci numbers","author":"Wang","year":"2024"},{"issue":"12","key":"ref25","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1038\/s41578-020-0229-6","article-title":"Solid-state nanopore sensors","volume":"5","author":"Xue","year":"2020","journal-title":"Nature Rev. Mater."},{"issue":"11","key":"ref26","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1038\/s41587-021-01108-x","article-title":"Nanopore sequencing technology, bioinformatics and applications","volume":"39","author":"Wang","year":"2021","journal-title":"Nature Biotechnol."},{"issue":"11","key":"ref27","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1038\/s41565-022-01193-2","article-title":"Nanopore-based technologies beyond DNA sequencing","volume":"17","author":"Ying","year":"2022","journal-title":"Nature Nanotechnol."},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206972"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2018.2866566"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/MBITS.2023.3318516"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2024.3403488"},{"issue":"10","key":"ref32","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1038\/s41587-019-0240-x","article-title":"Data storage in DNA with fewer synthesis cycles using composite DNA letters","volume":"37","author":"Anavy","year":"2019","journal-title":"Nature Biotechnol."},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007106"},{"key":"ref34","first-page":"1","article-title":"An upper bound on the capacity of the DNA storage channel","volume-title":"Proc. IEEE Inf. Theory Workshop (ITW)","author":"Lenz"},{"key":"ref35","first-page":"8846","article-title":"Achieving the capacity of the DNA storage channel","volume-title":"Proc. IEEE Int. Conf. Acoust., Speech Signal Process. (ICASSP)","author":"Lenz"},{"issue":"6","key":"ref36","doi-asserted-by":"crossref","first-page":"3675","DOI":"10.1109\/TIT.2021.3058966","article-title":"DNA-based storage: Models and fundamental limits","volume":"67","author":"Shomorony","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref37","first-page":"218","article-title":"Achieving the capacity of a DNA storage channel with linear coding schemes","volume-title":"Proc. 56th Annu. Conf. Inf. Sci. Syst. (CISS)","author":"Levick"},{"issue":"9","key":"ref38","doi-asserted-by":"crossref","first-page":"5657","DOI":"10.1109\/TIT.2022.3176371","article-title":"The DNA storage channel: Capacity and error probability bounds","volume":"68","author":"Weinberger","year":"2022","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"ref39","doi-asserted-by":"crossref","first-page":"2757","DOI":"10.1109\/TIT.2022.3231752","article-title":"The noisy drawing channel: Reliable data storage in DNA sequences","volume":"69","author":"Lenz","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref40","first-page":"757","article-title":"Anchor-based correction of substitutions in indexed sets","volume-title":"Proc. IEEE Int. Symp. Inf. Theory (ISIT)","author":"Lenz"},{"key":"ref41","first-page":"717","article-title":"Robust indexing\u2013optimal codes for DNA storage","volume-title":"Proc. IEEE Int. Symp.","author":"Sima"},{"key":"ref42","first-page":"579","article-title":"DNA-correcting codes: End-to-end correction in DNA storage systems","volume-title":"Proc. IEEE Int. Symp. Inf. Theory (ISIT)","author":"Boruchovsky"},{"key":"ref43","first-page":"383","article-title":"Index-based concatenated codes for the multi-draw DNA storage channel","volume-title":"Proc. IEEE Inf. Theory Workshop (ITW)","author":"Welter"},{"issue":"3","key":"ref44","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1038\/nbt.4079","article-title":"Random access in large-scale DNA data storage","volume":"36","author":"Organick","year":"2018","journal-title":"Nature Biotechnol."},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404638"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2282305"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3041570"},{"issue":"3","key":"ref48","doi-asserted-by":"crossref","first-page":"1560","DOI":"10.1109\/TIT.2021.3127174","article-title":"Clustering-correcting codes","volume":"68","author":"Shinkar","year":"2022","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"ref49","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1093\/bib\/bbac336","article-title":"Clover: Tree structure-based efficient DNA clustering for DNA-based data storage","volume":"23","author":"Qu","year":"2022","journal-title":"Briefings Bioinf."},{"issue":"6","key":"ref50","doi-asserted-by":"crossref","first-page":"3691","DOI":"10.1109\/TIT.2023.3241773","article-title":"Basis-finding algorithm for decoding fountain codes for DNA-based data storage","volume":"69","author":"He","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1002\/anie.201411378"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/j.procs.2016.05.398","article-title":"Forward error correction for DNA data storage","volume":"80","author":"Blawat","year":"2016","journal-title":"Proc. Comput. Sci."},{"issue":"1","key":"ref53","first-page":"5011","article-title":"Portable and error-free DNA-based data storage","volume-title":"Sci. Rep.","volume":"7","author":"Yazdi","year":"2017"},{"key":"ref54","doi-asserted-by":"crossref","DOI":"10.1109\/ISIT.2009.5205856","article-title":"On the rate of channel polarization","author":"Arikan","year":"2009"},{"key":"ref55","article-title":"Capacity-achieving rateless polar codes","author":"Li","year":"2015"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/10852562\/11165350-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8700143\/10852562\/11165350.pdf?arnumber=11165350","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T18:15:49Z","timestamp":1767896149000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11165350\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/jsait.2025.3610643","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}