{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T20:34:35Z","timestamp":1772138075644,"version":"3.50.1"},"reference-count":14,"publisher":"Oxford University Press (OUP)","issue":"7","license":[{"start":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T00:00:00Z","timestamp":1750636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000002","name":"NIH","doi-asserted-by":"publisher","award":["R35GM139602"],"award-info":[{"award-number":["R35GM139602"]}],"id":[{"id":"10.13039\/100000002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,7,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:sec>\n                    <jats:title>Summary<\/jats:title>\n                    <jats:p>Minimizer digestion is an increasingly common component of bioinformatics tools, including tools for de Bruijn graph assembly and sequence classification. We describe a new open source tool and library to facilitate efficient digestion of genomic sequences. It can produce digests based on the related ideas of minimizers, modimizers or syncmers. Digest uses efficient data structures, scales well to many threads, and produces digests with expected spacings between digested elements.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Availability and implementation<\/jats:title>\n                    <jats:p>Digest is implemented in C++17 with a Python API, and is available open-source at https:\/\/github.com\/VeryAmazed\/digest. The python library is available on Bioconda. Rust bindings are available as a public crate at https:\/\/crates.io\/crates\/digest-rs.<\/jats:p>\n                  <\/jats:sec>","DOI":"10.1093\/bioinformatics\/btaf368","type":"journal-article","created":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T07:59:40Z","timestamp":1750406380000},"source":"Crossref","is-referenced-by-count":0,"title":["Fast and flexible minimizer digestion with\n                    <tt>digest<\/tt>"],"prefix":"10.1093","volume":"41","author":[{"given":"Alan","family":"Zheng","sequence":"first","affiliation":[{"name":"Department of Computer Science, Johns Hopkins University , Baltimore, MD 21218,","place":["United States"]}]},{"given":"Ishmeal","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Johns Hopkins University , Baltimore, MD 21218,","place":["United States"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1424-3711","authenticated-orcid":false,"given":"Vikram S","family":"Shivakumar","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Johns Hopkins University , Baltimore, MD 21218,","place":["United States"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9933-8508","authenticated-orcid":false,"given":"Omar Y","family":"Ahmed","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Johns Hopkins University , Baltimore, MD 21218,","place":["United States"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2437-1976","authenticated-orcid":false,"given":"Ben","family":"Langmead","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Johns Hopkins University , Baltimore, MD 21218,","place":["United States"]}]}],"member":"286","published-online":{"date-parts":[[2025,6,23]]},"reference":[{"key":"2025070713464005400_btaf368-B1","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":"2025070713464005400_btaf368-B2","first-page":"282","author":"Bentley","year":"1977"},{"key":"2025070713464005400_btaf368-B3","doi-asserted-by":"crossref","first-page":"e10805","DOI":"10.7717\/peerj.10805","article-title":"Syncmers are more sensitive than minimizers for selecting conserved kmers in biological sequences","volume":"9","author":"Edgar","year":"2021","journal-title":"PeerJ"},{"key":"2025070713464005400_btaf368-B4","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1016\/j.cels.2021.08.009","article-title":"Minimizer-space de bruijn graphs: whole-genome assembly of long reads in minutes on a personal computer","volume":"12","author":"Ekim","year":"2021","journal-title":"Cell Syst"},{"key":"2025070713464005400_btaf368-B5","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1186\/s13015-025-00270-0","article-title":"The open-closed mod-minimizer algorithm","volume":"20","author":"Groot Koerkamp","year":"2025","journal-title":"Algorithms Mol Biol"},{"key":"2025070713464005400_btaf368-B6","doi-asserted-by":"crossref","first-page":"4812","DOI":"10.1093\/bioinformatics\/btac564","article-title":"nthash2: recursive spaced seed hashing for nucleotide sequences","volume":"38","author":"Kazemi","year":"2022","journal-title":"Bioinformatics"},{"key":"2025070713464005400_btaf368-B7","article-title":"A near-tight lower bound on the density of forward sampling schemes","volume":"41","author":"Kille","year":"2025","journal-title":"Bioinformatics"},{"key":"2025070713464005400_btaf368-B8","doi-asserted-by":"publisher","author":"Koerkamp","year":"2024","DOI":"10.1101\/2024.05.25.595898"},{"key":"2025070713464005400_btaf368-B9","doi-asserted-by":"crossref","first-page":"3492","DOI":"10.1093\/bioinformatics\/btw397","article-title":"nthash: recursive nucleotide hashing","volume":"32","author":"Mohamadi","year":"2016","journal-title":"Bioinformatics"},{"key":"2025070713464005400_btaf368-B10","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":"2025070713464005400_btaf368-B11","doi-asserted-by":"crossref","first-page":"3363","DOI":"10.1093\/bioinformatics\/bth408","article-title":"Reducing storage requirements for biological sequence comparison","volume":"20","author":"Roberts","year":"2004","journal-title":"Bioinformatics"},{"key":"2025070713464005400_btaf368-B12","first-page":"76","author":"Schleimer","year":"2003"},{"key":"2025070713464005400_btaf368-B13","unstructured":"Zheng A, Lee I, Shivakumar V \u00a0et al \u00a0digest v0.3.0, 2025. 10.5281\/zenodo.15538544"},{"key":"2025070713464005400_btaf368-B14","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1089\/cmb.2023.0094","article-title":"Creating and using minimizer sketches in computational genomics","volume":"30","author":"Zheng","year":"2023","journal-title":"J Comput Biol"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/advance-article-pdf\/doi\/10.1093\/bioinformatics\/btaf368\/63552637\/btaf368.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/41\/7\/btaf368\/63552637\/btaf368.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/41\/7\/btaf368\/63552637\/btaf368.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T13:46:55Z","timestamp":1751896015000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/doi\/10.1093\/bioinformatics\/btaf368\/8171987"}},"subtitle":[],"editor":[{"given":"Yann","family":"Ponty","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2025,6,23]]},"references-count":14,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,7,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btaf368","relation":{"has-preprint":[{"id-type":"doi","id":"10.1101\/2025.01.02.631161","asserted-by":"object"}]},"ISSN":["1367-4811"],"issn-type":[{"value":"1367-4811","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2025,7]]},"published":{"date-parts":[[2025,6,23]]},"article-number":"btaf368"}}