Evidence map›Paper›PMID 40536818›Full record

ArticleBriefings in bioinformatics2025

GC-balanced polar codes correcting insertions, deletions and substitutions for DNA storage.

Rui Zhang, Huaming Wu

Abstract read
In one paragraph

Article in Briefings in bioinformatics, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Rui ZhangChern Institute of Mathematics, Nankai University, 94 Weijin Road, 300071 Tianjin, China.
Huaming WuCenter for Applied Mathematics, Tianjin University, 92 Weijin Road, 300072 Tianjin, China.

Funding

National Key R&D Program of China 2020YFA0712100
6 · The paper itself

Abstract

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.

Indexed as

DNAAlgorithmsSequence Analysis, DNADNADNA storageGC-balanceIDS errorspolar code

Identifiers

PMID40536818
PMCPMC12204671

What Socratic holds

Textmetadata
LicenceCC BY-NC
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the Socratic graph.