Binning unassembled short reads based on k-mer covariance using sparse coding
Olexiy Kyrgyzov, Vincent ProstiD, Stéphane Gazut, Bruno Farcy, Thomas BrülsiD
Abstract
Sequence binning techniques enable the recovery of a growing number of genomes from complex microbial metagenomes and typically require prior metagenome assembly, incurring the computational cost and drawbacks of the latter, e.g. biases against low-abundance genomes and inability to conveniently assemble multi-terabyte datasets. We present here a scalable pre-assembly binning scheme (i.e. operating on unassembled short reads) enabling latent genomes recovery by leveraging sparse dictionary learning and elastic-net regularization, and its use to recover hundreds of metagenome-assembled genomes, including very low-abundance genomes, from a joint analysis of microbiomes from the LifeLines-Deep population cohort (n=1135, > 1010 reads). We showed that sparse coding techniques can be leveraged to carry out read-level binning at large scale, and that despite lower genome reconstruction yields compared to assembly-based approaches, bin-first strategies can complement the more widely used assembly-first protocols by targeting distinct genome segregation profiles. Read enrichment levels across six orders of magnitude in relative abundance were observed, indicating that the method is able to recover genomes consistently segregating at low levels.
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 9
- FWCI
- 0.65
- Field percentile
- top 39%
- Assay
- Research Focus
- Approach
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Adversarial and variational autoencoders improve metagenomic binning
Pau Piera Líndez, Joachim Johansen, … Simon Rasmussen·Communications BiologyPeer-reviewed·Oct 21, 2023
- binny: an automated binning algorithm to recover high-quality genomes from complex metagenomic datasets
Oskar Hickl, Pedro Queirós, … Anna Heintz‐Buschart·Briefings in BioinformaticsPeer-reviewed·Sep 7, 2022
- Efficient De Novo Assembly and Recovery of Microbial Genomes from Complex Metagenomes Using a Reduced Set of k-mers
Hajra Qayyum, Amjad H. Ali, Masood Ur Rehman Kayani·bioRxiv·Jun 8, 2024
- Binette: a fast and accurate bin refinement tool to construct high quality Metagenome Assembled Genomes.
Jean Mainguy, Claire Hoede·The Journal of Open Source SoftwarePeer-reviewed·Oct 5, 2024
- BinSPreader: refine binning results for fuller MAG reconstruction
Ivan Tolstoganov, Yury Kamenev, … Anton Korobeynikov·iSciencePeer-reviewed·Jul 19, 2022
- MAGNETO: an automated workflow for genome-resolved metagenomics
Benjamin Churcheward, Maxime Millet, … Samuel Chaffron·mSystemsPeer-reviewed·Jun 15, 2022