{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T08:02:19Z","timestamp":1784361739758,"version":"3.55.0"},"reference-count":28,"publisher":"Oxford University Press (OUP)","issue":"7","license":[{"start":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T00:00:00Z","timestamp":1781740800000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000051","name":"National Human Genome Research Institute","doi-asserted-by":"publisher","award":["R21HG013433"],"award-info":[{"award-number":["R21HG013433"]}],"id":[{"id":"10.13039\/100000051","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,7,2]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:sec>\n                    <jats:title>Summary<\/jats:title>\n                    <jats:p>Space-efficient compressed indexing methods are critical for pangenomics and for avoiding reference bias. In the Movi study, we implemented the move-structure index, highlighting its locality-of-reference and speed. However, Movi had a high memory footprint compared to other compressed indexes. Here, we introduce Movi 2 and describe new methods that greatly reduce size and memory footprint of move structure-based indexes. The most compressed version of Movi 2 reduces the Movi index\u2019s space footprint more than five-fold. We also introduce sampling approaches that enable trade-offs between query and space efficiency. To demonstrate, we show that Movi 2 achieves advantageous time and space tradeoffs when applied to large pangenome collections, including both the first and second releases of the Human Pangenome Reference Consortium (HPRC) collection, the latter of which spans over 460 human haplotypes. We show that Movi 2 dominates prior methods on both speed and memory footprint, including both r-index-based and our previous move-structure-based method.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Availability and implementation<\/jats:title>\n                    <jats:p>The methods we developed for Movi 2 are publicly available at https:\/\/github.com\/mohsenzakeri\/Movi.<\/jats:p>\n                  <\/jats:sec>","DOI":"10.1093\/bioinformatics\/btag362","type":"journal-article","created":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T12:38:37Z","timestamp":1781613517000},"source":"Crossref","is-referenced-by-count":0,"title":["Movi 2: fast and space-efficient queries on pangenomes"],"prefix":"10.1093","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9856-719X","authenticated-orcid":false,"given":"Mohsen","family":"Zakeri","sequence":"first","affiliation":[{"name":"Johns Hopkins University Department of Computer Science, , Baltimore, Maryland 21218,","place":["United States"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nathaniel K","family":"Brown","sequence":"additional","affiliation":[{"name":"Johns Hopkins University Department of Computer Science, , Baltimore, Maryland 21218,","place":["United States"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3689-327X","authenticated-orcid":false,"given":"Travis","family":"Gagie","sequence":"additional","affiliation":[{"name":"Dalhousie University Faculty of Computer Science, , Halifax, Nova Scotia B3H 4R2,","place":["Canada"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ben","family":"Langmead","sequence":"additional","affiliation":[{"name":"Johns Hopkins University Department of Computer Science, , Baltimore, Maryland 21218,","place":["United States"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2026,6,17]]},"reference":[{"key":"2026071803020576900_btag362-B1","first-page":"13","article-title":"Pla-index: a k-mer index exploiting rank curve linearity","volume":"312","author":"Abrar","year":"2024","journal-title":"LIPIcs Leibniz Int Proc Inf"},{"key":"2026071803020576900_btag362-B2","doi-asserted-by":"crossref","first-page":"102696","DOI":"10.1016\/j.isci.2021.102696","article-title":"Pan-genomic matching statistics for targeted nanopore sequencing","volume":"24","author":"Ahmed","year":"2021","journal-title":"iScience"},{"key":"2026071803020576900_btag362-B3","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1186\/s13059-023-02958-1","article-title":"Spumoni 2: improved classification using a pangenome index of minimizer digests","volume":"24","author":"Ahmed","year":"2023","journal-title":"Genome Biol"},{"key":"2026071803020576900_btag362-B4","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.tcs.2019.08.005","article-title":"Refining the r-index","volume":"812","author":"Bannai","year":"2020","journal-title":"Theor Comput Sci"},{"key":"2026071803020576900_btag362-B6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4230\/LIPIcs.SEA.2022.16","volume-title":"20th International Symposium on Experimental Algorithms (SEA 2022), Volume 233 of Leibniz International Proceedings in Informatics (LIPIcs)","author":"Brown","year":"2022"},{"key":"2026071803020576900_btag362-B7","article-title":"A block-sorting lossless data compression algorithm","author":"Burrows","year":"1994","journal-title":"Digit Equip Corporat,"},{"key":"2026071803020576900_btag362-B8","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1186\/s13059-020-02229-3","article-title":"Reference flow: reducing reference bias using multiple population genomes","volume":"22","author":"Chen","year":"2021","journal-title":"Genome Biol"},{"key":"2026071803020576900_btag362-B9","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1145\/1082036.1082039","article-title":"Indexing compressed text","volume":"52","author":"Ferragina","year":"2005","journal-title":"J ACM"},{"key":"2026071803020576900_btag362-B10","doi-asserted-by":"crossref","first-page":"1162","DOI":"10.14778\/3389133.3389135","article-title":"The pgm-index: a fully-dynamic compressed learned index with provable worst-case bounds","volume":"13","author":"Ferragina","year":"2020","journal-title":"Proc VLDB Endowment"},{"key":"2026071803020576900_btag362-B11","first-page":"1459","author":"Gagie","year":"2018"},{"key":"2026071803020576900_btag362-B12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3375890","article-title":"Fully functional suffix trees and optimal text searching in BWT-runs bounded space","volume":"67","author":"Gagie","year":"2020","journal-title":"J ACM"},{"key":"2026071803020576900_btag362-B13","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1093\/bioinformatics\/btaa911","article-title":"Sapling: accelerating suffix array queries with learned data models","volume":"37","author":"Kirsche","year":"2021","journal-title":"Bioinformatics"},{"key":"2026071803020576900_btag362-B14","doi-asserted-by":"crossref","first-page":"2074","DOI":"10.1109\/TIT.2022.3224382","article-title":"Towards a definitive compressibility measure for repetitive sequences","volume":"69","author":"Kociumaka","year":"2023","journal-title":"IEEE Trans Inform Theory"},{"key":"2026071803020576900_btag362-B15","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1038\/s41587-020-0731-9","article-title":"Targeted nanopore sequencing by real-time mapping of raw electrical signal with uncalled","volume":"39","author":"Kovaka","year":"2021","journal-title":"Nat Biotechnol"},{"key":"2026071803020576900_btag362-B16","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1089\/cmb.2019.0309","article-title":"Efficient construction of a complete index for pan-genomics read alignment","volume":"27","author":"Kuhnle","year":"2020","journal-title":"J Comput Biol"},{"key":"2026071803020576900_btag362-B17","doi-asserted-by":"crossref","first-page":"btae717","DOI":"10.1093\/bioinformatics\/btae717","article-title":"Bwt construction and search at the terabase scale","volume":"40","author":"Li","year":"2024","journal-title":"Bioinformatics"},{"key":"2026071803020576900_btag362-B18","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1038\/s41586-023-05896-x","article-title":"A draft human pangenome reference","volume":"617","author":"Liao","year":"2023","journal-title":"Nature"},{"key":"2026071803020576900_btag362-B19","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1186\/s13059-024-03240-8","article-title":"Measuring, visualizing, and diagnosing reference bias with biastools","volume":"25","author":"Lin","year":"2024","journal-title":"Genome Biol"},{"key":"2026071803020576900_btag362-B20","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/11496656_5","volume-title":"Combinatorial Pattern Matching: 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005. Proceedings","author":"M\u00e4Kinen","year":"2005"},{"key":"2026071803020576900_btag362-B21","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1089\/cmb.2019.0316","article-title":"Matching reads to many genomes using r-index","volume":"27","author":"Mun","year":"2020","journal-title":"J Comput Biol"},{"key":"2026071803020576900_btag362-B22","first-page":"101","author":"Nishimoto","year":"2021"},{"key":"2026071803020576900_btag362-B23","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1126\/science.abj6987","article-title":"The complete sequence of a human genome","volume":"376","author":"Nurk","year":"2022","journal-title":"Science"},{"key":"2026071803020576900_btag362-B24","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1093\/bioinformatics\/btaa835","article-title":"Pbsim2: a simulator for long-read sequencers with a novel generative model of quality scores","volume":"37","author":"Ono","year":"2021","journal-title":"Bioinformatics"},{"key":"2026071803020576900_btag362-B25","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1186\/s13059-018-1595-x","article-title":"FORGe: prioritizing variants for graph genomes","volume":"19","author":"Pritt","year":"2018","journal-title":"Genome Biol"},{"key":"2026071803020576900_btag362-B26","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/s00453-012-9618-6","article-title":"Sublinear algorithms for approximating string compressibility","volume":"65","author":"Raskhodnikova","year":"2013","journal-title":"Algorithmica"},{"key":"2026071803020576900_btag362-B27","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1089\/cmb.2021.0290","article-title":"MONI: a pangenomic index for finding maximal exact matches","volume":"29","author":"Rossi","year":"2022","journal-title":"J Comput Biol"},{"key":"2026071803020576900_btag362-B28","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1101\/gr.213611.116","article-title":"Evaluation of grch38 and de novo haploid genome assemblies demonstrates the enduring quality of the reference assembly","volume":"27","author":"Schneider","year":"2017","journal-title":"Genome Res"},{"key":"2026071803020576900_btag362-B29","doi-asserted-by":"crossref","first-page":"111464","DOI":"10.1016\/j.isci.2024.111464","article-title":"Movi: a fast and cache-efficient full-text pangenome index","volume":"27","author":"Zakeri","year":"2024","journal-title":"iScience"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/advance-article-pdf\/doi\/10.1093\/bioinformatics\/btag362\/68547439\/btag362.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/42\/7\/btag362\/68547439\/btag362.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/42\/7\/btag362\/68547439\/btag362.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T07:02:17Z","timestamp":1784358137000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/doi\/10.1093\/bioinformatics\/btag362\/8710943"}},"subtitle":[],"editor":[{"given":"Macha","family":"Nikolski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"editor"}]}],"short-title":[],"issued":{"date-parts":[[2026,6,17]]},"references-count":28,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,7,2]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btag362","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"value":"1367-4803","type":"print"},{"value":"1367-4811","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,7]]},"published":{"date-parts":[[2026,6,17]]},"article-number":"btag362"}}