Evidence map›Paper›PMID 32657364›Full record

ArticleBioinformatics (Oxford, England)2020

MetaBCC-LR: metagenomics binning by coverage and composition for long reads.

Anuradha Wickramarachchi, Vijini Mallawaarachchi, Vaibhav Rajan, Yu Lin

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 20 papers.

0numbers the graph read from it
0cells of the map it votes in
20citing 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

20 citing papers in PubMed.

  1. Article
  2. Review
  3. Review
  4. A review of neural networks for metagenomic binning.Briefings in bioinformatics · 2025
    Review
  5. Review
  6. Article
  7. Review
  8. Article
  9. Review
  10. Article
  11. Article
  12. Biological data studies, scale-up the potential with machine learning.European journal of human genetics : EJHG · 2023
    Article
  13. Article
  14. Recovery and Analysis of Long-Read Metagenome-Assembled Genomes.Methods in molecular biology (Clifton, N.J.) · 2023
    Article
  15. Metagenomic binning with assembly graph embeddings.Bioinformatics (Oxford, England) · 2022
    Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. 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.

Anuradha WickramarachchiResearch School of Computer Science, College of Engineering and Computer Science, Australian National University, Canberra, ACT 0200, Australia.
Vijini MallawaarachchiResearch School of Computer Science, College of Engineering and Computer Science, Australian National University, Canberra, ACT 0200, Australia.
Vaibhav RajanDepartment of Information Systems and Analytics, School of Computing, National University of Singapore, Singapore 117417, Singapore.
Yu LinResearch School of Computer Science, College of Engineering and Computer Science, Australian National University, Canberra, ACT 0200, Australia.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

motivationMetagenomics studies have provided key insights into the composition and structure of microbial communities found in different environments. Among the techniques used to analyse metagenomic data, binning is considered a crucial step to characterize the different species of micro-organisms present. The use of short-read data in most binning tools poses several limitations, such as insufficient species-specific signal, and the emergence of long-read sequencing technologies offers us opportunities to surmount them. However, most current metagenomic binning tools have been developed for short reads. The few tools that can process long reads either do not scale with increasing input size or require a database with reference genomes that are often unknown. In this article, we present MetaBCC-LR, a scalable reference-free binning method which clusters long reads directly based on their k-mer coverage histograms and oligonucleotide composition.

resultsWe evaluate MetaBCC-LR on multiple simulated and real metagenomic long-read datasets with varying coverages and error rates. Our experiments demonstrate that MetaBCC-LR substantially outperforms state-of-the-art reference-free binning tools, achieving ∼13% improvement in F1-score and ∼30% improvement in ARI compared to the best previous tools. Moreover, we show that using MetaBCC-LR before long-read assembly helps to enhance the assembly quality while significantly reducing the assembly cost in terms of time and memory usage. The efficiency and accuracy of MetaBCC-LR pave the way for more effective long-read-based metagenomics analyses to support a wide range of applications. AVAILABILITY AND IMPLEMENTATION: The source code is freely available at: https://github.com/anuradhawick/MetaBCC-LR. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Indexed as

AlgorithmsMetagenomicsMetagenomeSequence Analysis, DNASoftware

Identifiers

PMID32657364
PMCPMC7355282

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.