EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

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

Florestan De Moor, Olivier Boullé, Dominique Lavenier iD

Bioinformatics · 2025

DOI: 10.1093/bioinformatics/btaf618 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Bioinformatics, 2025. Verfasst von Florestan De Moor und 2 weiteren Autor:innen. Beteiligte Einrichtung: IRISA, CNRS, Rennes, 35042, France. Hauptthemen laut MEDLINE: Software, Sequence Analysis, DNA, DNA, Information Storage and Retrieval. Die Arbeit nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 recall. It is implemented in C++ within the software ConCluD and optimized for multi-core servers. Our experiments show that a dataset of 89 million reads, corresponding to a 10 GB fasta file, can be fully processed in less than a minute on a standard 32-cores server. Availability and implementation The ConCluD software and the scripts to reproduce the experiments from this paper are available at https://gitlab.inria.fr/pim/org.pim.dnarxiv under the GNU AGPLv3 licence. An archival snapshot of the repository is also provided at https://doi.org/10.5281/zenodo.17160067.

Schlagwörter

MeSH-Schlagwörter (MEDLINE)

SoftwareSequence Analysis, DNADNAInformation Storage and RetrievalAlgorithmsHigh-Throughput Nucleotide Sequencing

Substanzen

DNA

Autor:innen und Institutionen

  • IRISA, CNRS, Rennes, 35042, France.

ORCID-Profile: Dominique Lavenier

Zitieren

APA

De Moor, F., Boullé, O., & Lavenier, D. (2025). De-Bruijn graph partitioning for scalable and accurate DNA storage processing. Bioinformatics. https://doi.org/10.1093/bioinformatics/btaf618

Vancouver

De Moor F, Boullé O, Lavenier D. De-Bruijn graph partitioning for scalable and accurate DNA storage processing. Bioinformatics. 2025. doi:10.1093/bioinformatics/btaf618

BibTeX
@article{DeMoor2025,
  author = {De Moor, Florestan and Boullé, Olivier and Lavenier, Dominique},
  title = {De-Bruijn graph partitioning for scalable and accurate DNA storage processing},
  journal = {Bioinformatics},
  year = {2025},
  doi = {10.1093/bioinformatics/btaf618}
}
Kostenlos starten →