{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:16:06Z","timestamp":1775229366440,"version":"3.50.1"},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"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":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619202","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"97-102","source":"Crossref","is-referenced-by-count":16,"title":["Coding for Composite DNA to Correct Substitutions, Strand Losses, and Deletions"],"prefix":"10.1109","author":[{"given":"Frederik","family":"Walter","sequence":"first","affiliation":[{"name":"Institute for Communication Engineering, Technical University of Munich,Germany"}]},{"given":"Omer","family":"Sabary","sequence":"additional","affiliation":[{"name":"Technion-Israel Institute of Technology,Faculty of Computer Science,Haifa,Israel"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[{"name":"Institute for Communication Engineering, Technical University of Munich,Germany"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Technion-Israel Institute of Technology,Faculty of Computer Science,Haifa,Israel"}]}],"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.1126\/science.aaj2038"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/s41587-019-0240-x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-43105-w"},{"key":"ref7","volume-title":"Deep DNA Storage: Scalable and Robust DNA Storage via Coding Theory and Deep Learning","author":"Bar-Lev","year":"2021"},{"issue":"1","key":"ref8","first-page":"1951","article-title":"Reconstruction algorithms for DNA-storage systems","volume-title":"Scientific Reports","volume":"14","author":"Sabary","year":"2024"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1038\/s41598-024-58386-z","volume-title":"Efficient DNA-based data storage using shortmer combinatorial encoding","author":"Preuss","year":"2024"},{"issue":"1","key":"ref10","first-page":"15978","article-title":"Scaling logical density of DNA storage with enzymatically-ligated composite motifs","volume-title":"Scientific Reports","volume":"13","author":"Yan","year":"2023"},{"key":"ref11","volume-title":"M-DAB: An Input-Distribution Optimization Algorithm for Composite DNA Storage by the Multinomial Channel","author":"Kobovich","year":"2023"},{"key":"ref12","doi-asserted-by":"crossref","DOI":"10.1109\/TMBMC.2024.3408053","volume-title":"Sequencing coverage analysis for combinatorial DNA-based storage systems","author":"Preuss","year":"2024"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619348"},{"key":"ref14","first-page":"3460","article-title":"Limited-Magnitude Error Correction for Probability Vectors in DNA Storage","volume-title":"ICC 2022 - IEEE International Conference on Communications, Seoul, Korea, Republic of: IEEE, May 16, 2022","author":"Zhang"},{"key":"ref15","first-page":"1061","article-title":"On L1-distance error control codes","volume-title":"2011 IEEE International Symposium on Information Theory Proceedings","author":"Tallini"},{"key":"ref16","first-page":"741","article-title":"On symmetric L1 distance error control codes and elementary symmetric functions","volume-title":"2012 IEEE International Symposium on Information Theory Proceedings","author":"Tallini","year":"01\/27\/2024"},{"issue":"7","key":"ref17","first-page":"4239","article-title":"Optimal Codes With Small Constant Weight in $\\ell_1$-Metric","volume-title":"IEEE Transactions on Information Theory","volume":"67","author":"Chen","year":"2021"},{"issue":"10","key":"ref18","first-page":"6712","article-title":"Coding for the Lee and Manhattan Metrics With Weighing Matrices","volume-title":"IEEE Transactions on Information Theory","volume":"59","author":"Etzion","year":"2013"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-78602-3","volume-title":"Lectures on Advances in Combina-torics","author":"Ahlswede","year":"2008"},{"key":"ref20","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Soviet Physics Doklady"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1515\/9783110198119.273","volume-title":"On Single-Deletion-Correcting Codes","author":"Sloane","year":"2002"},{"issue":"3","key":"ref22","first-page":"288","article-title":"Codes which correct single asymmetric errors (in Russian)","volume":"161","author":"Varshamov","year":"1965","journal-title":"Automatika i Telemkhanika"},{"issue":"8","key":"ref23","first-page":"5115","article-title":"Nonasymptotic Upper Bounds for Deletion Correcting Codes","volume-title":"IEEE Transactions on Information Theory","volume":"59","author":"Kulkarni","year":"2013"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619202.pdf?arnumber=10619202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:07Z","timestamp":1773347347000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619202\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619202","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}