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

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.

Authors

Institutions

Publication Details

Journal
Bioinformatics
Published
2025-11-01
DOI
https://doi.org/10.1093/bioinformatics/btaf618
Primary Topic
DNA and Biological Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Dominique Lavenier, Olivier Boullé, Florestan De Moor
Bioinformatics
DNA and Biological Computing
article

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

Dominique Lavenier, Olivier Boullé, Florestan De Moor
article en

Abstract

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.

BioinformaticsVol. 41(11)
Centre National de la Recherche Scientifique (FR), Institut de Recherche en Informatique et Systèmes Aléatoires (FR)
Openalex Percentile: Top 69%
DNA and Biological Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.