Evidence map›Paper›PMID 39029947›Full record

ArticleGenome research2024

Graph-based self-supervised learning for repeat detection in metagenomic assembly.

Ali Azizpour, Advait Balaji, Todd J Treangen, Santiago Segarra

Abstract read
In one paragraph

Article in Genome research, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Ali AzizpourDepartment of Electrical and Computer Engineering, Houston, Texas 77005, USA; aa210@rice.edu advait@rice.edu treangen@rice.edu segarra@rice.edu.
Advait BalajiDepartment of Computer Science, Rice University, Houston, Texas 77005, USA; aa210@rice.edu advait@rice.edu treangen@rice.edu segarra@rice.edu.
Todd J TreangenDepartment of Computer Science, Rice University, Houston, Texas 77005, USA; aa210@rice.edu advait@rice.edu treangen@rice.edu segarra@rice.edu.ORCID 0000-0002-3760-564X
Santiago SegarraDepartment of Electrical and Computer Engineering, Houston, Texas 77005, USA; aa210@rice.edu advait@rice.edu treangen@rice.edu segarra@rice.edu.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Repetitive DNA (repeats) poses significant challenges for accurate and efficient genome assembly and sequence alignment. This is particularly true for metagenomic data, in which 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 nonrepetitive 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 pseudolabels for a small proportion of the nodes. We then use those pseudolabels 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 predefined and learned graph features to achieve state-of-the-art performance in repeat detection. We evaluate our method using simulated and synthetic metagenomic data sets. The results on the simulated data highlight GraSSRep's robustness to repeat attributes, demonstrating its effectiveness in handling the complexity of repeated sequences. Additionally, experiments with synthetic metagenomic data sets reveal that incorporating the graph structure and the GNN enhances the detection performance. Finally, in comparative analyses, GraSSRep outperforms existing repeat detection tools with respect to precision and recall.

Indexed as

MetagenomicsSupervised Machine LearningAlgorithmsMetagenomeNeural Networks, ComputerRepetitive Sequences, Nucleic AcidSequence Analysis, DNA

Identifiers

PMID39029947
PMCPMC11529840

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.