Evidence map›Paper›PMID 37202771›Full record

ArticleGenome biology2023

SPUMONI 2: improved classification using a pangenome index of minimizer digests.

Omar Y Ahmed, Massimiliano Rossi, Travis Gagie, Christina Boucher, Ben Langmead

Abstract read
In one paragraph

Article in Genome biology, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 34 papers.

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

34 citing papers in PubMed.

  1. Movi 2: fast and space-efficient queries on pangenomes.Bioinformatics (Oxford, England) · 2026
    Article
  2. Review
  3. Article
  4. Prefix-free parsing for merging big BWTs.International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium) · 2026
    Article
  5. KeBaB:International Symposium on String Processing and Information Retrieval : SPIRE ... : proceedings. SPIRE (Symposium) · 2026
    Article
  6. Col-BWT: Pangenomic Seed Chaining with Maximal Matches Improves Read Classification.Journal of computational biology : a journal of computational molecular cell biology · 2026
    Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Movi 2: Fast and Space-Efficient Queries on Pangenomes.bioRxiv : the preprint server for biology · 2025
    Article
  12. Article
  13. Article
  14. Fast and flexible minimizer digestion with digest.Bioinformatics (Oxford, England) · 2025
    Article
  15. Article
  16. Mem-based pangenome indexing for k-mer queries.Algorithms for molecular biology : AMB · 2025
    Article
  17. Faster run-length compressed suffix arrays.Oasics : openaccess series in informatics · 2025
    Article
  18. An Efficient Data Structure and Algorithm for Long-Match Query in Run-Length Compressed BWT.Algorithms in bioinformatics : ... International Workshop, WABI ..., proceedings. WABI (Workshop) · 2025
    Article
  19. Article
  20. Movi Color: fast and accurate taxonomic classification with the move structure.ACM-BCB ... ... : the ... ACM Conference on Bioinformatics, Computational Biology and Biomedicine. ACM Conference on Bioinformatics, Computational Biology and Biomedicine · 2025
    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

5 authors.

Omar Y AhmedDepartment of Computer Science, Johns Hopkins University, Baltimore, MD, USA. oahmed6@jhu.edu.
Massimiliano RossiDepartment of Computer & Information Science & Engineering, University of Florida, Gainesville, FL, USA.
Travis GagieFaculty of Computer Science, Dalhousie University, Halifax, NS, Canada.
Christina BoucherDepartment of Computer & Information Science & Engineering, University of Florida, Gainesville, FL, USA.
Ben LangmeadDepartment of Computer Science, Johns Hopkins University, Baltimore, MD, USA.ORCID 0000-0003-2437-1976

Funding

Personal and panel references for improved alignmentR01HG011392 · NHGRI · JOHNS HOPKINS UNIVERSITY · PI LANGMEAD, BENJAMIN THOMAS · 2020 to 2025
$4.2M
NHGRI NIH HHS R01 HG011392NHGRI NIH HHS R01HG011392
6 · The paper itself

Abstract

Genomics analyses use large reference sequence collections, like pangenomes or taxonomic databases. SPUMONI 2 is an efficient tool for sequence classification of both short and long reads. It performs multi-class classification using a novel sampled document array. By incorporating minimizers, SPUMONI 2's index is 65 times smaller than minimap2's for a mock community pangenome. SPUMONI 2 achieves a speed improvement of 3-fold compared to SPUMONI and 15-fold compared to minimap2. We show SPUMONI 2 achieves an advantageous mix of accuracy and efficiency in practical scenarios such as adaptive sampling, contamination detection and multi-class metagenomics classification.

Indexed as

AlgorithmsGenomicsDatabases, FactualMetagenomicsSequence Analysis, DNAClassificationIndexingMinimizerPangenome

Identifiers

PMID37202771
PMCPMC10197461

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.