Evidence map›Paper›PMID 35972375›Full record

ArticleBioinformatics (Oxford, England)2022

Metagenomic binning with assembly graph embeddings.

Andre Lamurias, Mantas Sereika, Mads Albertsen, Katja Hose, Thomas Dyhre Nielsen

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 34 papers, 1 of them a synthesis that pooled it.

0numbers the graph read from it
0cells of the map it votes in
34citing papers in PubMed, 1 pooled it
–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

34 citing papers in PubMed, 1 synthesis or guideline pooled it.

  1. Pooled it
  2. Article
  3. Review
  4. Review
  5. Article
  6. Review
  7. Article
  8. Article
  9. Bioinformatics advances · 2026
    Article
  10. Elucidating Transitions ofJournal of computational biology : a journal of computational molecular cell biology · 2026
    Article
  11. Article
  12. Review
  13. Article
  14. Article
  15. Article
  16. Review
  17. Article
  18. Article
  19. Article
  20. A review of neural networks for metagenomic binning.Briefings in bioinformatics · 2025
    Review
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

5 authors.

Andre LamuriasDepartment of Computer Science, Aalborg University, 9000 Aalborg, Denmark.ORCID 0000-0001-7965-6536
Mantas SereikaCenter for Microbial Communities, Department of Chemistry and Bioscience, Aalborg University, 9000 Aalborg, Denmark.
Mads AlbertsenCenter for Microbial Communities, Department of Chemistry and Bioscience, Aalborg University, 9000 Aalborg, Denmark.ORCID 0000-0002-6151-190X
Katja HoseDepartment of Computer Science, Aalborg University, 9000 Aalborg, Denmark.
Thomas Dyhre NielsenDepartment of Computer Science, Aalborg University, 9000 Aalborg, Denmark.

Funding

Poul Due Jensen Foundation (Microflora Danica)VILLUM FONDEN 34299
6 · The paper itself

Abstract

motivationDespite recent advancements in sequencing technologies and assembly methods, obtaining high-quality microbial genomes from metagenomic samples is still not a trivial task. Current metagenomic binners do not take full advantage of assembly graphs and are not optimized for long-read assemblies. Deep graph learning algorithms have been proposed in other fields to deal with complex graph data structures. The graph structure generated during the assembly process could be integrated with contig features to obtain better bins with deep learning.

resultsWe propose GraphMB, which uses graph neural networks to incorporate the assembly graph into the binning process. We test GraphMB on long-read datasets of different complexities, and compare the performance with other binners in terms of the number of High Quality (HQ) genome bins obtained. With our approach, we were able to obtain unique bins on all real datasets, and obtain more bins on most datasets. In particular, we obtained on average 17.5% more HQ bins when compared with state-of-the-art binners and 13.7% when aggregating the results of our binner with the others. These results indicate that a deep learning model can integrate contig-specific and graph-structure information to improve metagenomic binning. AVAILABILITY AND IMPLEMENTATION: GraphMB is available from https://github.com/MicrobialDarkMatter/GraphMB. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Indexed as

MetagenomeMetagenomicsAlgorithmsGenome, MicrobialSequence Analysis, DNA

Identifiers

PMID35972375
PMCPMC9525014

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.