Evidence map›Paper›PMID 41972095›Full record

ArticleACM-BCB ... ... : the ... ACM Conference on Bioinformatics, Computational Biology and Biomedicine. ACM Conference on Bioinformatics, Computational Biology and Biomedicine2025

Movi Color: fast and accurate taxonomic classification with the move structure.

Steven Tan, Sina Majidian, Ben Langmead, Mohsen Zakeri

Abstract read
In one paragraph

Article in ACM-BCB ... ... : the ... ACM Conference on Bioinformatics, Computational Biology and Biomedicine. ACM Conference on Bioinformatics, Computational Biology and Biomedicine, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

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

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

5 · Who and what money

Authors and funding

4 authors.

Steven TanDepartment of Computer Science, Johns Hopkins University, Baltimore, Maryland, USA.ORCID 0009-0000-1193-6005
Sina MajidianDepartment of Computer Science, Johns Hopkins University, Baltimore, Maryland, USA.ORCID 0000-0001-5345-6982
Ben LangmeadDepartment of Computer Science, Johns Hopkins University, Baltimore, Maryland, USA.ORCID 0000-0003-2437-1976
Mohsen ZakeriDepartment of Computer Science, Johns Hopkins University, Baltimore, Maryland, USA.ORCID 0000-0002-9856-719X

Funding

Efficient and scalable pangenomes with the move structureR21HG013433 · NHGRI · JOHNS HOPKINS UNIVERSITY · PI LANGMEAD, BENJAMIN THOMAS · 2024 to 2025
$399k
NHGRI NIH HHS R21 HG013433
6 · The paper itself

Abstract

The number of reference genomes is rapidly increasing, thanks to advances in long-read sequencing and assembly. While these collections can improve the sensitivity and specificity of classification methods, they require highly efficient compressed indexes. K-mer-based approaches like Kraken 2 are efficient but limit the analysis to a fixed k-mer length. This is hard for the user to set ahead of time, and suboptimal settings can harm sensitivity and specificity. Methods that use compressed full-text indexes like SPUMONI2 and Cliffy lift this constraint, but are less efficient than k-mer-based tools. Further, these methods either cannot report a full listing of genomes where a match occurs, or cannot scale to large reference databases. We propose new methods and algorithms that use compressed full-text indexes to enable multi-class and taxonomic classification. Unlike past compressed-indexing methods for classification, ours uses the move structure, which is extremely fast thanks to its locality of reference. Our method, called Movi Color, augments the main table of the Movi index. Specifically, Movi Color assigns a "color" to each run of the Burrows-Wheeler Transform according to the subset of genomes from which the run suffixes originated. When the reference is highly repetitive, as is typical when indexing pangenomes or reference databases, only certain colors occur, creating opportunities to compress the index. For species-level classification, Movi Color achieves over 1.9× higher positive predictive value (PPV) and about 3× higher sensitivity than Kraken 2 and Metabuli. At the genus level, it achieves 75% higher PPV than Metabuli, and over 50% higher sensitivity compared to Kraken 2. Movi Color's read processing time is 7-20× faster than Metabuli and is a comparable to Kraken 2. Although Movi Color uses more memory than both Kraken 2 and Metabuli, its speed-accuracy trade-off makes it well-suited for real-time and high-throughput scenarios.

Indexed as

BWTComparative genomicsCompressed indexingMove structurePangenomicsTaxonomic classification

Identifiers

PMID41972095
PMCPMC13067997

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.