Evidence map›Paper›PMID 26589281›Full record

ArticleBioinformatics (Oxford, England)2016

Large-scale machine learning for metagenomics sequence classification.

Kévin Vervier, Pierre Mahé, Maud Tournoud, Jean-Baptiste Veyrieras, Jean-Philippe Vert

Abstract read
In one paragraph

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

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

39 citing papers in PubMed.

  1. Article
  2. International journal of microbiology · 2026
    Review
  3. Review
  4. Article
  5. Article
  6. Article
  7. Machine learning for microbiologists.Nature reviews. Microbiology · 2024
    Review
  8. Article
  9. Article
  10. Article
  11. Review
  12. Article
  13. Review
  14. Binning Metagenomic Contigs Using Unsupervised Clustering and Reference Databases.Interdisciplinary sciences, computational life sciences · 2022
    Article
  15. Article
  16. Article
  17. Article
  18. Review
  19. Article
  20. 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.

Kévin VervierBioinformatics Research Departement, bioMérieux, 69280 Marcy-l'Étoile, MINES ParisTech, PSL Research University, CBIO-Centre for Computational Biology, 77300 Fontainebleau, Institut Curie, 75248 Paris Cedex and INSERM U900, 75248 Paris Cedex, France.
Pierre MahéBioinformatics Research Departement, bioMérieux, 69280 Marcy-l'Étoile.
Maud TournoudBioinformatics Research Departement, bioMérieux, 69280 Marcy-l'Étoile.
Jean-Baptiste VeyrierasBioinformatics Research Departement, bioMérieux, 69280 Marcy-l'Étoile.
Jean-Philippe VertMINES ParisTech, PSL Research University, CBIO-Centre for Computational Biology, 77300 Fontainebleau, Institut Curie, 75248 Paris Cedex and INSERM U900, 75248 Paris Cedex, France.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

motivationMetagenomics characterizes the taxonomic diversity of microbial communities by sequencing DNA directly from an environmental sample. One of the main challenges in metagenomics data analysis is the binning step, where each sequenced read is assigned to a taxonomic clade. Because of the large volume of metagenomics datasets, binning methods need fast and accurate algorithms that can operate with reasonable computing requirements. While standard alignment-based methods provide state-of-the-art performance, compositional approaches that assign a taxonomic class to a DNA read based on the k-mers it contains have the potential to provide faster solutions.

resultsWe propose a new rank-flexible machine learning-based compositional approach for taxonomic assignment of metagenomics reads and show that it benefits from increasing the number of fragments sampled from reference genome to tune its parameters, up to a coverage of about 10, and from increasing the k-mer size to about 12. Tuning the method involves training machine learning models on about 10(8) samples in 10(7) dimensions, which is out of reach of standard softwares but can be done efficiently with modern implementations for large-scale machine learning. The resulting method is competitive in terms of accuracy with well-established alignment and composition-based tools for problems involving a small to moderate number of candidate species and for reasonable amounts of sequencing errors. We show, however, that machine learning-based compositional approaches are still limited in their ability to deal with problems involving a greater number of species and more sensitive to sequencing errors. We finally show that the new method outperforms the state-of-the-art in its ability to classify reads from species of lineage absent from the reference database and confirm that compositional approaches achieve faster prediction times, with a gain of 2-17 times with respect to the BWA-MEM short read mapper, depending on the number of candidate species and the level of sequencing noise. AVAILABILITY AND IMPLEMENTATION: Data and codes are available at http://cbio.ensmp.fr/largescalemetagenomics CONTACT: pierre.mahe@biomerieux.com SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Indexed as

Machine LearningMetagenomicsSequence Analysis, DNAAlgorithmsMetagenomeSoftware

Identifiers

PMID26589281
PMCPMC4896366

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.