{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:04:35Z","timestamp":1775837075301,"version":"3.50.1"},"reference-count":23,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:00:00Z","timestamp":1750291200000},"content-version":"vor","delay-in-days":49,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"publisher","award":["2020YFA0712100"],"award-info":[{"award-number":["2020YFA0712100"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,5,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>In order to address the insertion, deletion, and substitution (IDS) errors inherent in deoxyribonucleic acid (DNA) storage channels during DNA synthesis and sequencing, we propose a novel GC-balanced polar code scheme tailored to rectify these errors by incorporating the unique characteristics of the DNA storage channel into the polar code design. The innovation lies in modeling errors as a drift vector, reflecting deviations from the desired DNA sequence, aiming to improve the reliability of DNA-based data storage. In this paper, we developed a GC-balanced polar code scheme named DNA-BP Code, which stands for balanced polar code for DNA storage, that effectively rectifies IDS errors in DNA storage. The computational complexity of the proposed encoding and decoding algorithms is $\\mathcal{O}(N\\log N)$ with respect to the code length $N$. Simulation results show the bit error rate and block error rate as functions of the code length and IDS probability, demonstrating the efficacy of our approach in enhancing the accuracy of DNA storage systems.<\/jats:p>","DOI":"10.1093\/bib\/bbaf278","type":"journal-article","created":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T21:12:40Z","timestamp":1751058760000},"source":"Crossref","is-referenced-by-count":3,"title":["GC-balanced polar codes correcting insertions, deletions and substitutions for DNA storage"],"prefix":"10.1093","volume":"26","author":[{"given":"Rui","family":"Zhang","sequence":"first","affiliation":[{"name":"Chern Institute of Mathematics, Nankai University , 94 Weijin Road, 300071 Tianjin ,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaming","family":"Wu","sequence":"additional","affiliation":[{"name":"Center for Applied Mathematics, Tianjin University , 92 Weijin Road, 300072 Tianjin ,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2025,6,19]]},"reference":[{"key":"2025062717123034500_ref1","doi-asserted-by":"crossref","first-page":"btae274","DOI":"10.1093\/bioinformatics\/btae274","article-title":"Gradhc: highly reliable gradual hash-based clustering for DNA storage systems","volume":"40","author":"Shabat","year":"2024","journal-title":"Bioinformatics"},{"key":"2025062717123034500_ref2","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1093\/nsr\/nwaa007","article-title":"DNA storage: research landscape and future prospects","volume":"7","author":"Dong","year":"2020","journal-title":"Natl Sci Rev"},{"key":"2025062717123034500_ref3","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1109\/TNB.2021.3056351","article-title":"Minimum free energy coding for DNA storage","volume":"20","author":"Cao","year":"2021","journal-title":"IEEE Trans Nanobiosci"},{"key":"2025062717123034500_ref4","doi-asserted-by":"publisher","first-page":"2000046","DOI":"10.1002\/sstr.202000046","article-title":"Data storage based on DNA","volume":"2","author":"Hao","year":"2021","journal-title":"Small Struct"},{"key":"2025062717123034500_ref5","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/TCBB.2020.3011582","article-title":"Designing uncorrelated address constrain for DNA storage by DMVO algorithm","volume":"19","author":"Cao","year":"2022","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"2025062717123034500_ref6","doi-asserted-by":"publisher","first-page":"2992","DOI":"10.1109\/TCBB.2023.3263521","article-title":"High net information density DNA data storage by the mope encoding algorithm","volume":"20","author":"Zheng","year":"2023","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"2025062717123034500_ref7","doi-asserted-by":"crossref","first-page":"btae113","DOI":"10.1093\/bioinformatics\/btae113","article-title":"A dual-rule encoding DNA storage system using chaotic mapping to control GC content","volume":"40","author":"Zhang","year":"2024","journal-title":"Bioinformatics"},{"key":"2025062717123034500_ref8","doi-asserted-by":"publisher","first-page":"1431","DOI":"10.1109\/TCOMM.2024.3455235","article-title":"Efficient explicit and pseudo-random constructions of constrained codes for DNA storage","volume":"73","author":"He","year":"2025","journal-title":"IEEE Trans Commun"},{"key":"2025062717123034500_ref9","doi-asserted-by":"crossref","first-page":"bbac484","DOI":"10.1093\/bib\/bbac484","article-title":"Multiple errors correction for position-limited DNA sequences with GC balance and no homopolymer for DNA-based data storage","volume":"24","author":"Li","year":"2023","journal-title":"Brief Bioinform"},{"key":"2025062717123034500_ref10","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1126\/science.1226355","article-title":"Next-generation digital information storage in DNA","volume":"337","author":"Church","year":"2012","journal-title":"Science"},{"key":"2025062717123034500_ref11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1038\/nature11875","article-title":"Towards practical, high-capacity, low-maintenance information storage in synthesized DNA","volume":"494","author":"Goldman","year":"2013","journal-title":"Nat"},{"key":"2025062717123034500_ref12","doi-asserted-by":"publisher","first-page":"2552","DOI":"10.1002\/anie.201411378","article-title":"Robust chemical preservation of digital information on DNA in silica with error-correcting codes","volume":"54","author":"Grass","year":"2015","journal-title":"Angew Chem Int Ed Engl"},{"key":"2025062717123034500_ref13","article-title":"Random access in large-scale DNA data storage","volume":"36","author":"Organick","year":"2018","journal-title":"Nat Biotechnol"},{"key":"2025062717123034500_ref14","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1109\/TETC.2022.3225570","article-title":"A segmented-edit error-correcting code with re-synchronization function for DNA-based storage systems","volume":"11","author":"Yan","year":"2022","journal-title":"IEEE Trans Emerg Top Comput"},{"key":"2025062717123034500_ref15","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","article-title":"Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels","volume":"55","author":"Arikan","year":"2009","journal-title":"IEEE Trans Inform Theory"},{"key":"2025062717123034500_ref16","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/ITW.2009.5351487","article-title":"Polarization for arbitrary discrete memoryless channels","volume-title":"2009 IEEE Information Theory Workshop","author":"\u015ea\u015fo\u011flu","year":"2009"},{"key":"2025062717123034500_ref17","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/LCOMM.2017.2650918","article-title":"Polar coding for the binary erasure channel with deletions","volume":"21","author":"Thomas","year":"2017","journal-title":"IEEE Commun Lett"},{"key":"2025062717123034500_ref18","doi-asserted-by":"crossref","first-page":"1869","DOI":"10.1109\/ISIT.2018.8437713","article-title":"Polar coding for deletion channels: theory and implementation","volume-title":"2018 IEEE International Symposium on Information Theory (ISIT)","author":"Tian","year":"2018"},{"key":"2025062717123034500_ref19","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1587\/transfun.2019EAP1079","article-title":"Insertion\/deletion\/substitution error correction by a modified successive cancellation decoding of polar code","volume":"103","author":"Koremura","year":"2020","journal-title":"IEICE Trans Fund Electron Commun Comput Sci"},{"key":"2025062717123034500_ref20","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1109\/ISIT44484.2020.9174042","article-title":"Polar codes with balanced codewords","volume-title":"2020 IEEE International Symposium on Information Theory (ISIT)","author":"Gupta","year":"2020"},{"key":"2025062717123034500_ref21","doi-asserted-by":"publisher","first-page":"3264","DOI":"10.1038\/s41467-020-16958-3","article-title":"Quantifying molecular bias in DNA data storage. Nat","volume":"11","author":"Chen","year":"2020","journal-title":"Commun"},{"key":"2025062717123034500_ref22","doi-asserted-by":"crossref","first-page":"3746","DOI":"10.1073\/pnas.83.11.3746","article-title":"Breslauer, Ronald frank, Helmut Bl\u00f6cker et\u00a0al. Predicting DNA duplex stability from the base sequence","volume":"83","author":"Kenneth","year":"1986","journal-title":"Proc Natl Acad Sci"},{"key":"2025062717123034500_ref23","doi-asserted-by":"publisher","first-page":"140972","DOI":"10.1109\/ACCESS.2020.3012688","article-title":"Construction of GC-balanced DNA with deletion\/insertion\/mutation error correction for DNA storage system","volume":"8","author":"Xue","year":"2020","journal-title":"IEEE Access"}],"container-title":["Briefings in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bib\/article-pdf\/26\/3\/bbaf278\/63527886\/bbaf278.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bib\/article-pdf\/26\/3\/bbaf278\/63527886\/bbaf278.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T21:12:42Z","timestamp":1751058762000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bib\/article\/doi\/10.1093\/bib\/bbaf278\/8169300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,1]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,5,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bib\/bbaf278","relation":{},"ISSN":["1467-5463","1477-4054"],"issn-type":[{"value":"1467-5463","type":"print"},{"value":"1477-4054","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2025,5]]},"published":{"date-parts":[[2025,5,1]]},"article-number":"bbaf278"}}