GraSSRep: Graph-Based Self-Supervised Learning for Repeat Detection in Metagenomic Assembly
Not on the map. Why?
Abstract (arXiv)
Repetitive DNA (repeats) poses significant challenges for accurate and efficient genome assembly and sequence alignment. This is particularly true for metagenomic data, where genome dynamics such as horizontal gene transfer, gene duplication, and gene loss/gain complicate accurate genome assembly from metagenomic communities. Detecting repeats is a crucial first step in overcoming these challenges. To address this issue, we propose GraSSRep, a novel approach that leverages the assembly graph's structure through graph neural networks (GNNs) within a self-supervised learning framework to classify DNA sequences into repetitive and non-repetitive categories. Specifically, we frame this problem as a node classification task within a metagenomic assembly graph. In a self-supervised fashion, we rely on a high-precision (but low-recall) heuristic to generate pseudo-labels for a small proportion of the nodes. We then use those pseudo-labels to train a GNN embedding and a random forest classifier to propagate the labels to the remaining nodes. In this way, GraSSRep combines sequencing features with pre-defined and learned graph features to achieve state-of-the-art performance in repeat detection. We evaluate our method using simulated and synthetic metagenomic datasets. The results on the simulated data highlight our GraSSRep's robustness to repeat attributes, demonstrating its effectiveness in handling the complexity of repeated sequences. Additionally, our experiments with synthetic metagenomic datasets reveal that incorporating the graph structure and the GNN enhances our detection performance. Finally, in comparative analyses, GraSSRep outperforms existing repeat detection tools with respect to precision and recall.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 10 of its 47 references that are in the map. First posted on arXiv 14 Feb 2024.
Builds on
10 of 47 references.
References · 10
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
- 2020A Survey on Contrastive Self-supervised Learningcited by 553
- 2017Representation Learning on Graphs: Methods and Applicationscited by 456
- 2020Unfolding WMMSE using Graph Neural Networks for Efficient Power Allocationcited by 61
- 2021Link Scheduling using Graph Neural Networkscited by 26
- 2014Stability and Continuity of Centrality Measures in Weighted Graphscited by 4
- 2020Deep Demixing: Reconstructing the Evolution of Epidemics Using Graph Neural Networkscited by 4
Built on by
Citing papers per year: 2024: 1; 2025: 2.
3 papers.
- 2024Scalable Implicit Graphon Learningcited by 8
- 2025Model-Driven Graph Contrastive Learningcited by 0
- 2025From Moments to Models: Graphon-Mixture Learning for Mixup and Contrastive Learningcited by 0
- 2025From Moments to Models: Graphon-Mixture Learning for Mixup and Contrastive Learning4 Oct 2025
- 2025Model-Driven Graph Contrastive Learning6 Jun 2025
- 2024Scalable Implicit Graphon Learning22 Oct 2024