DNA data storage is a rapidly developing technology with great potential due to its high density, long-term durability, and low maintenance cost. The major technical challenges include various errors, such as strand breaks, rearrangements, and indels that frequently arise during DNA synthesis, amplification, sequencing, and preservation. In this study, a de novo strand assembly algorithm (DBGPS) is developed using de Bruijn graph and greedy path search to meet these challenges. DBGPS shows substantial advantages in handling DNA breaks, rearrangements, and indels. The robustness of DBGPS is demonstrated by accelerated aging, multiple independent data retrievals, deep error-prone PCR, and large-scale simulations. Remarkably, 6.8 MB of data is accurately recovered from a severely corrupted sample that has been treated at 70 °C for 70 days. With DBGPS, we are able to achieve a logical density of 1.30 bits/cycle and a physical density of 295 PB/g.
Deoxyribonucleic acid provides unmatched information density and longevity for data storage, yet its easy amplification by polymerase chain reaction enables unauthorized replication at negligible cost. We introduce ZAT-DNA, which encodes information in patterns of canonical adenine and noncanonical 2-aminoadenine. As DNA polymerases cannot distinguish adenine from 2-aminoadenine, polymerase-based amplification erases these patterns, enforcing molecular-layer non-replicability intrinsic to the base-pairing ambiguity. We validate ZAT-DNA for secure key storage, demonstrating error-free encoding, storage, and high-fidelity nanopore retrieval of 32-bit and 64-bit cryptographic keys. ZAT-DNA blocks polymerase-based copying and protects non-fungible tokens by preventing functional duplication. For larger datasets, we present a hybrid “Babel-DNA” architecture: multiple encrypted images are co-encoded in a single regular DNA pool, with each selectively decryptable only via its cognate, non-replicable ZAT-DNA key. This provides a practical framework for molecular access control, secure DNA-encoded databases, and scarce molecular tokens.
1 March 2026 in Computational and Structural Biotechnology Journal
Although several tools exist for prokaryotic genome correction, most depend on external read mappers that impose computational overhead and usability barriers, leaving a need for fast, accurate, standalone solutions. We present ProGenFixer, a mapping-free tool that identifies and corrects errors in prokaryotic genomes using next-generation sequencing data. ProGenFixer compares k -mer profiles between an input genome and sequencing reads to pinpoint discrepancies, then applies a local assembly-based algorithm with a conservative correction strategy suited to refining high-quality reference genomes. In benchmarking, ProGenFixer ran over 5× faster than the existing tools tested while maintaining higher accuracy. Against slower but highly accurate tools, it showed comparable accuracy while running >17× faster, with better performance on long indels (>10 bp). ProGenFixer is designed primarily for conservative updating of already curated reference sequences rather than aggressive polishing of draft assemblies; accordingly, it does not automatically replace a reference base when substantial read support exists for both the reference and alternate alleles. Comparisons using 3 real bacterial resequencing datasets showed that most tool-specific disagreements occurred at mixed-support or low-depth sites, emphasizing that correction aggressiveness and accuracy are not equivalent in this application. ProGenFixer is implemented in C and runs as a standalone program with no external dependencies. The software is freely available at https://github.com/Scilence2022/ProGenFixer . A companion web platform is available at https://progenfixer.biodesign.ac.cn .
Although prokaryotic genomes are simpler, making variation analysis more straightforward, an efficient and user-friendly tool for their rapid sequence correction is lacking. We present ProGenFixer, an ultra-fast, mapping-free tool specifically designed to efficiently identify and correct errors in prokaryotic genomes using next-generation sequencing (NGS) data. ProGenFixer compares k -mer profiles between the reference genome and reads to pinpoint discrepancies, employs a local assembly-based algorithm to estimate corrected sequences, and automatically implements corrections. Benchmarking demonstrates ProGenFixer’s speed and accuracy advantages. It is over >5x faster than the swiftest existing tool tested while maintaining higher accuracy. Compared to slower, highly accurate tools, ProGenFixer shows comparable accuracy but is >17x faster and demonstrates enhanced performance on long indels (>10 bp). Implemented in C, ProGenFixer is a standalone, user-friendly tool offering a comprehensive solution for prokaryotic genome correction. The software is freely available at https://github.com/Scilence2022/ProGenFixer . Additionally, a companion web-based platform offering a ready-to-use interface can be accessed at https://progenfixer.biodesign.ac.cn .