The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
SemiBin2: self-supervised contrastive learning leads to better MAGs for short- and long-read sequencing
Open accessAbstract
Motivation: Metagenomic binning methods to reconstruct metagenome-assembled genomes (MAGs) from environmental samples have been widely used in large-scale metagenomic studies. The recently proposed semi-supervised binning method, SemiBin, achieved state-of-the-art binning results in several environments. However, this required annotating contigs, a computationally costly and potentially biased process. Results: We propose SemiBin2, which uses self-supervised learning to learn feature embeddings from the contigs. In simulated and real datasets, we show that self-supervised learning achieves better results than the semi-supervised learning used in SemiBin1 and that SemiBin2 outperforms other state-of-the-art binners. Compared to SemiBin1, SemiBin2 can reconstruct 8.3–21.5% more high-quality bins and requires only 25% of the running time and 11% of peak memory usage in real short-read sequencing samples. To extend SemiBin2 to long-read data, we also propose ensemble-based DBSCAN clustering algorithm, resulting in 13.1–26.3% more high-quality genomes than the second best binner for long-read data. Availability and implementation: SemiBin2 is available as open source software at https://github.com/BigDataBiology/SemiBin/ and the analysis scripts used in the study can be found at https://github.com/BigDataBiology/SemiBin2_benchmark.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Minimap2: Pairwise alignment for nucleotide sequences
Li, H. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty191 · Cited by 14,807
Parks, D. H., Imelfort, M., Skennerton, C. T., Hugenholtz, P., & Tyson, G. W. (2015) · Genome Research · doi:10.1101/gr.186072.114 · Cited by 12,496
MMseqs2 enables sensitive protein sequence searching for the analysis of massive data sets
Steinegger, M., & Söding, J. (2017) · Nature Biotechnology · doi:10.1038/nbt.3988 · Cited by 4,840
Performance of neural network basecalling tools for Oxford Nanopore sequencing
Wick, R. R., Judd, L. M., & Holt, K. E. (2019) · Genome Biology · doi:10.1186/s13059-019-1727-y · Cited by 3,221
Density-Based Clustering Based on Hierarchical Density Estimates
Campello, R. J. G. B., Moulavi, D., & Sander, J. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-37456-2_14 · Cited by 2,680
Shotgun metagenomics, from sampling to analysis
Quince, C., Walker, A. W., Simpson, J. T., Loman, N. J., & Segata, N. (2017) · Nature Biotechnology · doi:10.1038/nbt.3935 · Cited by 2,202
Chklovski, A., Parks, D. H., Woodcroft, B. J., & Tyson, G. W. (2023) · Nature Methods · doi:10.1038/s41592-023-01940-w · Cited by 1,705
Wirbel, J., Pyl, P. T., Kartal, E., Zych, K., Kashani, A., Milanese, A., Fleck, J. S., Voigt, A. Y., Palleja, A., Ponnudurai, R., et al. (2019) · Nature Medicine · doi:10.1038/s41591-019-0406-6 · Cited by 1,373
Self-citationHarnessing protein folding neural networks for peptide–protein docking
Tsaban, T., Varga, J. K., Avraham, O., Ben-Aharon, Z., Khramushin, A., & Schueler-Furman, O. (2022) · Nature Communications · doi:10.1038/s41467-021-27838-9 · Cited by 1,205
Deep Learning is Robust to Massive Label Noise
Rolnick, D., Veit, A., Belongie, S., & Shavit, N. (2017) · arXiv · doi:10.48550/arxiv.1705.10694 · Cited by 402
Tørresen, O. K., Star, B., Mier, P., Andrade-Navarro, M. A., Bateman, A., Jarnot, P., Gruca, A., Grynberg, M., Kajava, A. V., Promponas, V. J., et al. (2019) · Nucleic Acids Research · doi:10.1093/nar/gkz841 · Cited by 347
Cited by
CoverM: read alignment statistics for metagenomics
Aroney, S. T. N., Newell, R. J. P., Nissen, J. N., Camargo, A. P., Tyson, G. W., & Woodcroft, B. J. (2025) · Bioinformatics · doi:10.1093/bioinformatics/btaf147 · Cited by 511
Arikawa, K., & Hosokawa, M. (2023) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2023.09.010 · Cited by 13
A multi-modal deep language model for contaminant removal from metagenome-assembled genomes
Zou, B., Wang, J., Ding, Y., Zhang, Z., Huang, Y., Fang, X., Cheung, K. C., See, S., & Zhang, L. (2024) · Nature Machine Intelligence · doi:10.1038/s42256-024-00908-5 · Cited by 9
Metadata
- Authors
- Pan, S., Zhao, X.-M., & Coelho, L. P.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2023-06-01
- Volume
- 39
- Issue
- Supplement_1
- Pages
- i21-i29
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W4382631636
- Cited by
- 201
- References
- 12
- FWCI
- 15.17
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.