Back

DipGNNome: Diploid de novo genome assembly with geometric deep learning and beam-search

Schmitz, M.; Vrcek, L.; Kawaguchi, K.; Sikic, M.

2025-09-18 genomics
10.1101/2025.09.16.676474 bioRxiv
Show abstract

De novo genome assembly remains a central challenge in computational biology, particularly for diploid genomes where maternal and paternal haplotypes must be accurately resolved. Existing assemblers achieve impressive results through carefully designed heuristics, yet modern deep learning methods remain largely unexplored in the diploid setting. We present DipGNNome, the first deep learning-based framework for diploid de novo genome assembly. Our approach formulates assembly as an edge classification and traversal problem on haplotype-aware assembly graphs, training graph neural networks (GNNs) to guide contig construction. To enable this, we establish a novel pipeline for generating diploid graphs with ground-truth edge labels, providing the first systematic way to produce training data for machine learning models in this domain. This framework creates a foundation for applying and extending graph-based deep learning to diploid assembly. DipGNNome creates assemblies comparable to state-of-the-art and demonstrates the feasibility of deep learning for diploid assembly and introduces a paradigm that bridges algorithmic genomics with graph representation learning. Our code, dataset and trained model is openly available at https://github.com/lbcb-sci/DipGNNome.

Matching journals

The top 4 journals account for 50% of the predicted probability mass.

50% of probability mass above

"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.