De-Bruijn graph partitioning for scalable and accurate DNA storage processing.

ABSTRACT:

Motivation

DNA-based data storage offers a compelling solution for long-term, high-density archiving. In this framework, accurately reconstructing high-quality encoded sequences after sequencing is critical, as it directly impacts the design of error-correcting codes optimized for DNA storage. Furthermore, efficient and scalable processing is essential to manage the large volumes of data expected in such applications.

Results

We introduce a novel method based on de-Bruijn graph partitioning, enabling fast and accurate processing of sequencing data regardless of the underlying sequencing technology and without requiring prior knowledge of the information encoded in the oligonucleotides. Evaluated on both synthetic and real datasets, the method achieves excellent precision and

SUBMITTER: De Moor F 

PROVIDER: S-EPMC12619639 | biostudies-literature | 2025 Nov

REPOSITORIES: biostudies-literature