Fast Pangenome Matching Statistics in Compressed Space with Move Structures
Nathaniel K BrowniD, Ahsan SanaullahiD, Pramesh ShakyaiD, Shaojie ZhangiD, Ben LangmeadiD
Abstract
Matching statistics and supermaximal exact matches (SMEMs) are key inputs for sequence homology search and classification. Methods such as MONI, PHONI, and ropebwt3 compute these statistics using compressed pangenome indexes, but are substantially slower than methods that compute approximations of matching statistics, such as pseudo-matching lengths (PMLs). PMLs can be computed quickly in a single pass, but SMEM computation can require overlapping forward or backward passes over the query. We present ms2, a suite of algorithms that use "move structures" to compute matching statistics and SMEMs efficiently in compressed space. Our four algorithms compose move structures for the LF, {Psi}, {varphi}, and {varphi}-1 permutations with additional longest common prefix (LCP) array summaries and samples. The algorithms offer different tradeoffs among speed, index size, and support for reporting SMEM offsets. They inherit the move structure's fast, constant-time operations and achieve high throughput by leveraging the move structure's locality of reference. Thanks to recent advances, move structures can be constructed in optimal time and compressed space, including the LCP information needed for "match recovery" during SMEM computation. On 100 haplotypes of human chromosome 22, ms2's fastest algorithm computes matching statistics 35 to 48 times as fast as PHONI's online approach, while using an index of similar size. On the 472-haplotype HPRC2 pangenome and human reads, three ms2 modes achieve speedups of at least 22, 19, and 15 times over ropebwt3, whose index is about 15% the size of ms2's fastest mode. When additionally reporting SMEMs and their offsets, ms2 achieves speedups of 25 to 34 times over ropebwt3. Together, these advances enable online computation of matching statistics and SMEMs at a throughput that supports real-time processing of approximately 21 PromethION nanopore flow cells on a single thread. The ms2 software is open source and available at https://github.com/langmead-lab/ms2. It builds on the open-source TeraTools suite (https://github.com/ucfcbb/TeraTools) and Orbit library (https://github.com/drnatebrown/orbit). Experimental scripts and other details are described in: https://github.com/langmead-lab/ms2-experiments.
02 /Specification & Classification
Click any tag to browse matching papers- Organism
- 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
- Fast and compact matching statistics analytics
Fabio Cunial, Olgert Denas, Djamal Belazzougui·BioinformaticsPeer-reviewed·Jan 31, 2022
- Movi: a fast and cache-efficient full-text pangenome index
Mohsen Zakeri, Nathaniel K. Brown, … Ben Langmead·iSciencePeer-reviewed·Nov 27, 2024
- Movi 2: Fast and Space-Efficient Queries on Pangenomes
Mohsen Zakeri, Nathaniel K. Brown, … Ben Langmead·BioinformaticsPeer-reviewed·Jun 16, 2026
- MONI-k: An index for efficient pangenome-to-pangenome comparison
Travis Gagie·bioRxiv·Aug 9, 2022
- MONI: A Pangenomics Index for Finding MEMs
Massimiliano Rossi, Marco Oliva, … Christina A. Boucher·bioRxiv·Jul 6, 2021
- MEM-based pangenome indexing for k-mer queries
Stephen Hwang, Nathaniel K. Brown, … Ben Langmead·bioRxiv·May 20, 2024