bioRxivBioinformaticsPreprint
Lightweight compositional analysis of metagenomes with FracMinHash and minimum metagenome covers
Luiz C. IrberiD, Phillip BrooksiD, Taylor E. ReiteriD, N. Tessa Pierce‐WardiD, Mahmudur Rahman HeraiD, David KoslickiiD, C. Titus BrowniD
Abstract
The identification of reference genomes and taxonomic labels from metagenome data underlies many microbiome studies. Here we describe two algorithms for compositional analysis of metagenome sequencing data. We first investigate the FracMinHash sketching technique, a derivative of modulo hash that supports Jaccard containment estimation between sets of different sizes. We implement FracMinHash in the sourmash software, evaluate its accuracy, and demonstrate large-scale containment searches of metagenomes using 700,000 microbial reference genomes. We next frame shotgun metagenome compositional analysis as the problem of finding a minimum collection of reference genomes that "cover" the known k-mers in a metagenome, a minimum set cover problem. We implement a greedy approximate solution using FracMinHash sketches, and evaluate its accuracy for taxonomic assignment using a CAMI community benchmark. Finally, we show that the minimum metagenome cover can be used to guide the selection of reference genomes for read mapping. sourmash is available as open source software under the BSD 3-Clause license at github.com/dib-lab/sourmash/.
- organism: bacteria (other)
- assay: metagenomics
- research focus: software / tool
- research focus: benchmarking
- approach: statistical model
In-depth summary
Claude Opus 5.5 · xhigh effort · 8 Nov 2026 · from the full text of version 2 (17 Jan 2022) · CC BY 4.0
Greedy minimum set cover over FracMinHash k-mer sketches selects a small set of reference genomes explaining a metagenome, supporting species-level taxonomic profiling and choice of genomes for read mapping.
With 1.1m microbial reference genomes in GenBank as of November 2021, most metagenome methods work from representative subsets (bioBakery 3 uses 99.2k genomes), which the authors note can reduce sensitivity and precision. This work instead searches the whole database for the smallest genome set accounting for a metagenome's known k-mers, using FracMinHash sketches that, unlike MinHash, estimate containment between sets of very different sizes.
Key results
ShownOn the simulated Critical Assessment of Metagenome Interpretation (CAMI) mouse gut benchmark, taxonomic profiles built from minimum metagenome covers retained high completeness down to species level and had the highest species-level purity of the 10 profilers compared.
Species level: 88.7% completeness; purity 95.9% with predictions under 1% abundance filtered and 97% unfiltered, highest among methods. Also second-lowest L1-norm error, most true positives and fewest false positives. Sixty-four CAMISIM samples from 791 genomes, profiled against the CAMI Jan 8, 2019 RefSeq snapshot and scored with OPAL; other methods lose completeness below genus. · Minimum metagenome covers can accurately…; Minimum metagenome covers support accurate and…; Taxonomy
ShownAgainst 725,339 GenBank genomes, greedy covers were small (≈100 genomes for several metagenomes; 19 for one mock) despite overlaps with tens or hundreds of thousands of genomes: from redundancy removal where k-mers are mostly identified, but for the oil well sample because much of it is absent from the database.
Four metagenomes (podar and zymo mocks, human gut, oil well) at scaled=2000, k=31, counting matches above 100,000 estimated shared k-mers: covers of 19 and 99 genomes for one mock and one real sample that match 406k and 96k genomes; zymo mock's Salmonella resolves to one genome among over 200,000 matches; gut real matches over 75,000 E. coli genomes. · Minimum metagenome covers select small subsets…; Minimum set covers can be used for accurate…; GenBank database sketching and searches
ShownFracMinHash containment estimates in sourmash were about as accurate as MinHash-based containment tools on a mock community, with sketch sizes comparable to MinHash sketches at n=1000 to 10000.
podar mock, k=21/31/51 vs exact k-mer sets: all methods within 1% of exact containment on average; CMash consistently underestimated; Mash Screen n=10000 closest at k=21 and 31, then FracMinHash scaled=1000 and Mash Screen n=1000. sourmash sketches held 431 to 9540 hashes (median 2741). · A FracMinHash implementation accurately…; FracMinHash provides efficient containment…; Comparison between CMash, mash screen, and…
ShownGreedy rank ordering splits a metagenome's k-mers among genomes, with k-mers shared by related strains credited to the earlier match; in the podar mock just over half of the k-mers matched GenBank.
podar mock: 205m (54.8%) of 375m k-mers found in GenBank; the remaining 169m (45.2%) are put down to sequencing errors or unknown community members. Two Shewanella baltica strains share approximately 50% of their k-mers; the shared ones go to OS223 (rank 8), so OS185 (rank 33) is matched only on its own k-mers. · FracMinHash can be used to construct a minimum…; Figure legends
SuggestedMapping reads to cover genomes one at a time in rank order, removing reads already mapped, gives per-genome coverage that tracks the k-mer estimates, supporting use of the cover to pick mapping references.
Four Table 1 metagenomes, minimap2 -x sr via genome-grist, first 36 cover genomes, unrescaled axes: close agreement for the two mocks; for the gut and oil well samples mapping coverage tends to exceed k-mer estimates, possibly because only species-level, not strain, genomes are in the database. No summary agreement statistic is reported. · Minimum metagenome covers provide representative…; Read mapping and hybrid mapping pipeline; Figure legends
Methods, data and reproducibility
FracMinHash sketches keep all k-mer hashes below a fixed threshold set by the scaled factor s; implemented in sourmash and compared with exact k-mer sets, CMash and Mash Screen. A greedy minimum set cover (sourmash gather) ranks reference genomes by remaining k-mer overlap with a metagenome; covers were turned into taxonomic profiles and used to order iterative read mapping.
- podar mock community shotgun metagenome (mock bacterial and archaeal community with largely known reference genomes) · bacteria and archaea (mock community)
- CAMI mouse gut metagenome (MGM) benchmark, simulated with CAMISIM; short-read Illumina and long-read PacBio data · bacteria and archaea (791 genomes, 549 species) · n = Sixty-four samples; 91.8 genomes per sample on average
- zymo mock community metagenome
- Human gut microbiome metagenome from the Integrative Human Microbiome Project (iHMP) ('gut real') · human gut microbiome
- Oil well metagenome ('oil well real')
- Microbial genome subset of GenBank (July 2020), sketched at scaled=2000, k=31; 24 GB database · microbial · n = 725,339 genomes
- RefSeq snapshot of Jan 8, 2019 provided by CAMI, used as the reference for the taxonomic benchmark
- Methods & tools
- sourmash, CMash, Mash Screen, genome-grist, minimap2, snakemake, OPAL, CAMISIM, samtools, bedtools, fastp, sra-tools
- Code
- http://github.com/dib-lab/sourmash/https://github.com/sourmash-bio/sourmash/https://github.com/dib-lab/genome-grist/https://github.com/dib-lab/2021-paper-sourmash-gather-pipeline
- Data & accessions
- https://github.com/dib-lab/2021-paper-sourmash-gather-pipeline
- Software & environment
- sourmash v4.2.3 (Python and Rust); genome-grist v0.7.4 run with conf-paper.yml; minimap2 v2.17; workflow dependencies installed by snakemake via conda and bioconda; figures from v0.1 Jupyter Notebooks of the paper pipeline repository.
- Reproducibility gaps
- The metagenome accession list in Methods is empty in this text; the 24 GB sketched GenBank database is said to be downloadable through the sourmash project but no URL is given; no runtime, memory or hardware figures are reported.
Limitations (6)
- Fully reference dependent: the exact strains in a sample are often missing from the database, and exact k-mer matching tolerates variants less than read mapping, giving a systematic k-mer vs mapping mismatch in real metagenomes. · stated by the authors
- Subsampled hashes may fail to separate very closely related genomes, and very large sketches may hinder use on very large metagenomes. · stated by the authors
- Low sensitivity for small queries whose k-mer count approaches s (gene- or virus-sized sequences); the containment estimator is biased, though the bias factor nears 1 for large sets and s. · stated by the authors
- k-mers are an imperfect proxy for mapping, so selected genomes may sometimes be wrong; the extent of such false negatives has not been evaluated and is expected to affect mainly strain and species calls. · stated by the authors
- Ties between equally good matches are broken at random, per-hash abundance counts are not used when removing k-mers (possibly relevant for repetitive, e.g. eukaryotic, genomes), and there is no read-level taxonomic assignment yet. · stated by the authors
- Containment accuracy is tested on a single mock community (podar), taxonomic accuracy only on simulated CAMI data, and k-mer vs mapping agreement on four metagenomes judged from plots without a summary statistic. · noted in this summary
Read this if you profile shotgun metagenomes against very large reference collections and want a sketch-based way to pick a small, non-redundant set of genomes for taxonomic profiling or read mapping.
- Citations
- 69
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
- Fast, lightweight, and accurate metagenomic functional profiling using FracMinHash sketches
Mahmudur Rahman Hera, Shaopeng Liu, … David Koslicki·bioRxiv·Nov 6, 2023
- Improving Min Hash via the Containment Index with applications to Metagenomic Analysis
David Koslicki, Hooman Zabeti·Applied Mathematics and ComputationPeer-reviewed·Mar 1, 2019
- Mash Screen: High-throughput sequence containment estimation for genome discovery
Brian Ondov, Gabriel J. Starrett, … Adam M. Phillippy·Genome biologyPeer-reviewed·Nov 5, 2019
- Sketching the SRA: experiment-wide similarity search across 4.8 million metagenomes
Roland Faure, Adrita Hossain Nakshi, … Paul Medvedev·bioRxiv·Oct 8, 2026
- Connecting Syncmers to FracMinHash: similarities and advantages
Shaopeng Liu, David Koslicki·bioRxiv·Nov 9, 2023
- Metalign: Efficient alignment-based metagenomic profiling via containment min hash
Nathan LaPierre, Mohammed Alser, … Serghei Mangul·Genome biologyPeer-reviewed·Sep 10, 2020