{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T20:36:07Z","timestamp":1792787767665,"version":"4.5.0"},"reference-count":110,"publisher":"SAGE Publications","license":[{"start":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T00:00:00Z","timestamp":1791331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"name":"H2020 European Research Council","award":["ERC CoG 101088572"],"award-info":[{"award-number":["ERC CoG 101088572"]}],"id":[{"id":"https:\/\/ror.org\/0472cxd90","id-type":"ROR","asserted-by":"crossref"}]},{"name":"Institut National de la Sant\u00e9 et de la Recherche M\u00e9dicale","award":["ITMO Cancer of Aviesan 2021-2030 Cancer control st"],"award-info":[{"award-number":["ITMO Cancer of Aviesan 2021-2030 Cancer control st"]}],"id":[{"id":"https:\/\/ror.org\/02vjkv261","id-type":"ROR","asserted-by":"crossref"}]},{"name":"Agence Nationale de la Recherche","award":["ANR-21-CE45-0012"],"award-info":[{"award-number":["ANR-21-CE45-0012"]}],"id":[{"id":"https:\/\/ror.org\/00rbzpz17","id-type":"ROR","asserted-by":"crossref"}]},{"name":"Agence Nationale de la Recherche","award":["ANR-22-CE45-0007"],"award-info":[{"award-number":["ANR-22-CE45-0007"]}],"id":[{"id":"https:\/\/ror.org\/00rbzpz17","id-type":"ROR","asserted-by":"crossref"}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Biology"],"abstract":"<jats:p>\n                    Approximate membership query structures are used throughout sequence bioinformatics, from read screening and metagenomic classification to assembly, indexing, and error correction. Among them, Bloom filters remain the default choice. They are not the most efficient structures in either time or memory, but they provide an effective compromise between compactness, speed, simplicity, and dynamic insertions, which explains their widespread adoption in practice. Their main drawback is poor cache locality, since each query typically requires several random memory accesses. Blocked Bloom filters alleviate this issue by restricting accesses for any given element to a single memory block, but this usually comes with a loss in accuracy at fixed memory. In this work, we introduce the Super Bloom Filter, a Bloom filter variant designed for streaming\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -mer queries on biological sequences. Super Bloom uses minimizers to group adjacent\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -mers into super-\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -mers and assigns all\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -mers of a group to the same memory block, thereby amortizing random accesses over consecutive\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -mer queries and improving cache efficiency. We further combine this layout with the findere scheme, which reduces false positives by requiring consistent evidence across overlapping subwords. We provide a theoretical analysis of the construction of Super Bloom filters, showing how minimizer density controls the expected reduction in memory transfers, and derive a practical parameterization strategy linking memory budget, block size, collision overhead, and the number of hash functions to robust false-positive control. Across a broad range of memory budgets and numbers of hash functions, Super Bloom consistently outperforms existing Bloom filter implementations, with several-fold time improvements. As a practical validation, we integrated it into a Rust reimplementation of BioBloom Tools, a sequence screening tool that builds filters from reference genomes and classifies reads through\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -mer membership queries for applications such as host removal and contamination filtering. This replacement yields substantially faster indexing and querying than both the original C++ implementation and Rust variants based on Bloom filters and blocked Bloom filters. The findere scheme also reduces false positives by several orders of magnitude, with some configurations yielding no observed false positives among\n                    <jats:inline-formula>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                        <mml:mrow>\n                          <mml:mrow>\n                            <mml:msup>\n                              <mml:mrow>\n                                <mml:mrow>\n                                  <mml:mn>10<\/mml:mn>\n                                <\/mml:mrow>\n                              <\/mml:mrow>\n                              <mml:mn>9<\/mml:mn>\n                            <\/mml:msup>\n                          <\/mml:mrow>\n                        <\/mml:mrow>\n                      <\/mml:math>\n                    <\/jats:inline-formula>\n                    randomly queried\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -mers. Code is available at\n                    <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/EtienneC-K\/SuperBloom\">https:\/\/github.com\/EtienneC-K\/SuperBloom<\/jats:ext-link>\n                    and\n                    <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/Malfoy\/SBB\">https:\/\/github.com\/Malfoy\/SBB<\/jats:ext-link>\n                    .\n                  <\/jats:p>","DOI":"10.1177\/15578666261493564","type":"journal-article","created":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T16:55:22Z","timestamp":1791392122000},"update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Super Bloom: Fast and Precise Filter for Streaming\n                    <i>k<\/i>\n                    -Mer Queries"],"prefix":"10.1177","author":[{"given":"Etienne","family":"Conchon-Kerjan","sequence":"first","affiliation":[{"name":"Univ. Lille, CNRS, Centrale Lille, UMR 9189 CRIStAL, Lille, France."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2799-6714","authenticated-orcid":false,"given":"Timoth\u00e9","family":"Rouz\u00e9","sequence":"additional","affiliation":[{"name":"Institut Pasteur, Universit\u00e9 Paris Cit\u00e9, Paris, France."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lucas","family":"Robidou","sequence":"additional","affiliation":[{"name":"I2BC, Universit\u00e9 Paris-Saclay, CNRS, CEA, Gif sur Yvette, France."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8556-0087","authenticated-orcid":false,"given":"Florian","family":"Ingels","sequence":"additional","affiliation":[{"name":"Univ. Lille, CNRS, Centrale Lille, UMR 9189 CRIStAL, Lille, France."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antoine","family":"Limasset","sequence":"additional","affiliation":[{"name":"Univ. Lille, CNRS, Centrale Lille, UMR 9189 CRIStAL, Lille, France."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2026,10,7]]},"reference":[{"key":"e_1_3_4_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.10.007"},{"key":"e_1_3_4_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btab408"},{"key":"e_1_3_4_4_1","doi-asserted-by":"crossref","unstructured":"Bender MA Farach-Colton M Johnson R et al. Don\u2019t thrash: How to cache your hash on flash. In: 3rd Workshop on Hot Topics in Storage and File Systems (HotStorage 11). 2011.","DOI":"10.14778\/2350229.2350275"},{"key":"e_1_3_4_5_1","volume-title":"European conference on computational biology (ECCB)","author":"Benoit G","year":"2014","unstructured":"Benoit G, , Lavenier D, , Lemaitre C, et al. Bloocoo, a memory efficient read corrector. In: European conference on computational biology (ECCB). ECCB; 2014."},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-015-0709-7"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3538598.3538613"},{"key":"e_1_3_4_8_1","first-page":"285","volume-title":"International Symposium on String Processing and Information Retrieval","author":"Bingmann T","year":"2019","unstructured":"Bingmann T, , Bradley P, , Gauger F, et al. (2019) Cobs: a compact bit-sliced signature index. In: International Symposium on String Processing and Information Retrieval. Springer, pp. 285\u2013303."},{"key":"e_1_3_4_9_1","first-page":"1","volume-title":"Bloom filters. a tutorial, analysis, and survey","author":"Blustein J","year":"2002","unstructured":"Blustein J, , El-Maazawi A. Bloom filters. a tutorial, analysis, and survey. Dalhousie University: Halifax, NS; 2002, pp. 1\u201331."},{"key":"e_1_3_4_10_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41587-018-0010-1"},{"key":"e_1_3_4_11_1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.3519"},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3213880.3213884"},{"key":"e_1_3_4_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btv419"},{"key":"e_1_3_4_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"key":"e_1_3_4_15_1","doi-asserted-by":"crossref","unstructured":"Carter L Floyd R Gill J et al. Exact and approximate membership testers. In: Proceedings of the tenth annual ACM symposium on Theory of computing. ACM; 1978 pp. 59\u201365.","DOI":"10.1145\/800133.804332"},{"key":"e_1_3_4_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"e_1_3_4_17_1","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-8-22"},{"key":"e_1_3_4_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw279"},{"key":"e_1_3_4_19_1","first-page":"35","volume-title":"International conference on Research in computational molecular biology","author":"Chikhi R","year":"2014","unstructured":"Chikhi R, , Limasset A, , Jackman S, et al. (2014) On the representation of de bruijn graphs. In: International conference on Research in computational molecular biology. Springer, pp. 35\u201355."},{"key":"e_1_3_4_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz902"},{"key":"e_1_3_4_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.07.024"},{"key":"e_1_3_4_22_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu558"},{"key":"e_1_3_4_23_1","doi-asserted-by":"publisher","DOI":"10.12688\/f1000research.6924.1"},{"key":"e_1_3_4_24_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty567"},{"key":"e_1_3_4_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btac492"},{"key":"e_1_3_4_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589285"},{"key":"e_1_3_4_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3682027"},{"key":"e_1_3_4_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_32"},{"key":"e_1_3_4_29_1","unstructured":"Dillinger PC Walzer S. Ribbon filter: Practically smaller than bloom and xor. arXiv Preprint 2021."},{"key":"e_1_3_4_30_1","unstructured":"Dillinger PC H\u00fcbschle-Schneider L Sanders P et al. Fast succinct retrieval and approximate membership using ribbon. arXiv Preprint 2021."},{"key":"e_1_3_4_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732967.2732968"},{"key":"e_1_3_4_32_1","doi-asserted-by":"publisher","unstructured":"Fan B Andersen DG Kaminsky M et al. Cuckoo filter: Practically better than bloom. In: Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies CoNEXT \u201814. Association for Computing Machinery: New York NY; 2014 pp. 75\u201388; doi: 10.1145\/2674005.2674994","DOI":"10.1145\/2674005.2674994"},{"key":"e_1_3_4_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"e_1_3_4_34_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa1054"},{"key":"e_1_3_4_35_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaf251"},{"issue":"11","key":"e_1_3_4_36_1","article-title":"akmerbroom: Ancient oral dna decontamination using bloom filters on k-mer sets","volume":"26","author":"Gonz\u00e1lez CD","year":"2023","unstructured":"Gonz\u00e1lez CD, , Rangavittal S, , Vicedomini R, et al. akmerbroom: Ancient oral dna decontamination using bloom filters on k-mer sets. iScience 2023;26(11).","journal-title":"iScience"},{"key":"e_1_3_4_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3376122"},{"key":"e_1_3_4_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3510449"},{"key":"e_1_3_4_39_1","article-title":"Simdminimizers: Computing random minimizers, fast","author":"Groot Koerkamp R","year":"2025","unstructured":"Groot Koerkamp R, , Martayan I. Simdminimizers: Computing random minimizers, fast. bioRxiv 2025.","journal-title":"bioRxiv"},{"key":"e_1_3_4_40_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-025-00270-0"},{"key":"e_1_3_4_41_1","doi-asserted-by":"crossref","unstructured":"Gupta G Yan M Coleman B et al. Fast processing and querying of 170tb of genomics data via a repeated and merged bloom filter (rambo). In: Proceedings of the 2021 International Conference on Management of Data. ACM; 2021 pp. 2226\u20132234.","DOI":"10.1145\/3448016.3457333"},{"key":"e_1_3_4_42_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz662"},{"key":"e_1_3_4_43_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw146"},{"key":"e_1_3_4_44_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu030"},{"key":"e_1_3_4_45_1","first-page":"156","volume-title":"International Symposium on String Processing and Information Retrieval","author":"Hernandez-Courbevoie Y","year":"2025","unstructured":"Hernandez-Courbevoie Y, , Salson M, , Bessi\u00e8re C, et al. (2025) Reindeer2: Practical abundance index at scale. In: International Symposium on String Processing and Information Retrieval. Springer, pp. 156\u2013171."},{"key":"e_1_3_4_46_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-020-02135-8"},{"key":"e_1_3_4_47_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-016-0066-8"},{"key":"e_1_3_4_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.108"},{"key":"e_1_3_4_49_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bts673"},{"key":"e_1_3_4_50_1","article-title":"Abyss-konnector: Connect paired-end reads by navigating a bloom filter de bruijn graph","author":"Jackman SD","year":"2014","unstructured":"Jackman SD. Abyss-konnector: Connect paired-end reads by navigating a bloom filter de bruijn graph. F1000posters 2014.","journal-title":"F1000posters"},{"key":"e_1_3_4_51_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.214346.116"},{"key":"e_1_3_4_52_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-018-07641-9"},{"key":"e_1_3_4_53_1","doi-asserted-by":"crossref","unstructured":"Jerzak Z Fetzer C. Bloom filter based routing for content-based publish\/subscribe. In: Proceedings of the second international conference on Distributed event-based systems. ACM; 2008 pp. 71\u201381.","DOI":"10.1145\/1385989.1385999"},{"key":"e_1_3_4_54_1","doi-asserted-by":"crossref","unstructured":"Lee T Kim K Kim HJ. Join processing using bloom filter in mapreduce. In: Proceedings of the 2012 ACM Research in Applied Computation Symposium. ACM; 2012 pp. 100\u2013105.","DOI":"10.1145\/2401603.2401626"},{"key":"e_1_3_4_55_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btac689"},{"key":"e_1_3_4_56_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioadv\/vbac029"},{"key":"e_1_3_4_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230636"},{"key":"e_1_3_4_58_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btv290"},{"key":"e_1_3_4_59_1","unstructured":"Li Y Tian C Guo F et al. {ElasticBF}: Elastic bloom filter with hotness awareness for boosting read performance in large {Key-Value} stores. In: 2019 USENIX Annual Technical Conference (USENIX ATC 19). ATC; 2019 pp. 739\u2013752."},{"key":"e_1_3_4_60_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btad225"},{"key":"e_1_3_4_61_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa487"},{"key":"e_1_3_4_62_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btab217"},{"key":"e_1_3_4_63_1","article-title":"Helicase: Vectorized parsing and bitpacking of genomic sequences","author":"Martayan I","year":"2026","unstructured":"Martayan I, , Lobet L, , Marchet C, et al. Helicase: Vectorized parsing and bitpacking of genomic sequences. bioRxiv 2026; doi: 10.64898\/2026.03.19.712912","journal-title":"bioRxiv"},{"key":"e_1_3_4_64_1","first-page":"330","volume-title":"International Conference on Research in Computational Molecular Biology","author":"Martayan I","year":"2025","unstructured":"Martayan I, , Robidou L, , Shibuya Y, et al. (2025) Hyper-k-mers: efficient streaming k-mers representation. In: International Conference on Research in Computational Molecular Biology. Springer, pp. 330\u2013335."},{"key":"e_1_3_4_65_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-023-02971-4"},{"key":"e_1_3_4_66_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-333"},{"key":"e_1_3_4_67_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw609"},{"key":"e_1_3_4_68_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw397"},{"key":"e_1_3_4_69_1","doi-asserted-by":"crossref","unstructured":"Mun JH Lim H. Cache sharing using a bloom filter in named data networking. In: Proceedings of the 2016 Symposium on Architectures for Networking and Communications Systems. ACM; 2016 pp. 127\u2013128.","DOI":"10.1145\/2881025.2889477"},{"key":"e_1_3_4_70_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.260174.119"},{"key":"e_1_3_4_71_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-38553-y"},{"key":"e_1_3_4_72_1","unstructured":"Nosa-Ihaza E Okenwa E Tongun SL et al. Syncmers minimizers and beyond: Next-generation seeding for scalable genomics. 2026."},{"key":"e_1_3_4_73_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-016-0997-x"},{"key":"e_1_3_4_74_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-015-0663-4"},{"issue":"7","key":"e_1_3_4_75_1","first-page":"1154","article-title":"Efficient minimizer orders for large values of k using minimum decycling sets","volume":"33","author":"Pellow D","year":"2023","unstructured":"Pellow D, , Pu L, , Ekim B, et al. Efficient minimizer orders for large values of k using minimum decycling sets. Genome Res 2023;33(7):1154\u20131161.","journal-title":"Genome Res"},{"key":"e_1_3_4_76_1","first-page":"209965","article-title":"Discosnp++: De novo detection of small variants from raw unassembled read set (s)","author":"Peterlongo P","year":"2017","unstructured":"Peterlongo P, , Riou C, , Drezen E, et al. Discosnp++: De novo detection of small variants from raw unassembled read set (s). BioRxiv 2017:209965.","journal-title":"BioRxiv"},{"key":"e_1_3_4_77_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btac245"},{"key":"e_1_3_4_78_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btad219"},{"key":"e_1_3_4_79_1","doi-asserted-by":"publisher","DOI":"10.1093\/nargab\/lqaf094"},{"key":"e_1_3_4_80_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa458"},{"key":"e_1_3_4_81_1","first-page":"4","article-title":"Cache-, hash-, and space-efficient bloom filters","volume":"14","author":"Putze F","year":"2010","unstructured":"Putze F, , Sanders P, , Singler J. Cache-, hash-, and space-efficient bloom filters. J Exp Algorithmics 2010;14:4.","journal-title":"J Exp Algorithmics"},{"key":"e_1_3_4_82_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu545"},{"key":"e_1_3_4_83_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btad305"},{"key":"e_1_3_4_84_1","first-page":"151","volume-title":"International Symposium on String Processing and Information Retrieval","author":"Robidou L","year":"2021","unstructured":"Robidou L, , Peterlongo P. findere: fast and precise approximate membership query. In: International Symposium on String Processing and Information Retrieval. Springer; 2021, pp. 151\u2013163."},{"key":"e_1_3_4_85_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu132"},{"key":"e_1_3_4_86_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-15-S9-S7"},{"key":"e_1_3_4_87_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-13-S6-S5"},{"key":"e_1_3_4_88_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.275648.121"},{"key":"e_1_3_4_89_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu538"},{"key":"e_1_3_4_90_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw321"},{"key":"e_1_3_4_91_1","doi-asserted-by":"crossref","unstructured":"Schleimer S Wilkerson DS Aiken A. Winnowing: Local algorithms for document fingerprinting. In: Proceedings of the 2003 ACM SIGMOD international conference on Management of data. ACM; 2003 pp. 76\u201385.","DOI":"10.1145\/872757.872770"},{"key":"e_1_3_4_92_1","unstructured":"Schmitz JE Zentgraf J Rahmann S. Blocked bloom filters with choices. arXiv Preprint 2025."},{"key":"e_1_3_4_93_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.isci.2021.102782"},{"key":"e_1_3_4_94_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41592-023-02018-3"},{"key":"e_1_3_4_95_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btac845"},{"key":"e_1_3_4_96_1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.3442"},{"key":"e_1_3_4_97_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2017.0265"},{"key":"e_1_3_4_98_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-014-0509-9"},{"key":"e_1_3_4_99_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btad101"},{"key":"e_1_3_4_100_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2017.0258"},{"key":"e_1_3_4_101_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.278623.123"},{"key":"e_1_3_4_102_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gku1187"},{"key":"e_1_3_4_103_1","doi-asserted-by":"crossref","unstructured":"Vandervalk BP Jackman SD Raymond A et al. Konnector: Connecting paired-end reads using a bloom filter de bruijn graph. In: 2014 IEEE international conference on bioinformatics and biomedicine (BIBM). IEEE; 2014 pp. 51\u201358.","DOI":"10.1109\/BIBM.2014.6999126"},{"key":"e_1_3_4_104_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364333"},{"key":"e_1_3_4_105_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz400"},{"key":"e_1_3_4_106_1","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2014-15-3-r46"},{"key":"e_1_3_4_107_1","unstructured":"Zentgraf J Rahmann S. Fast gapped k-mer counting with subdivided multi-way bucketed cuckoo hash tables. In: 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022). Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik; 2022 p. 12."},{"key":"e_1_3_4_108_1","doi-asserted-by":"crossref","unstructured":"Zeyl T Cheng Q Pournaghi R et al. Including bloom filters in bottom-up optimization. In: Companion of the 2025 International Conference on Management of Data. ACM: 2025 pp. 703\u2013715.","DOI":"10.1145\/3722212.3724440"},{"key":"e_1_3_4_109_1","doi-asserted-by":"crossref","unstructured":"Zhang H Lim H Leis V et al. Surf: Practical range query filtering with fast succinct tries. In: Proceedings of the 2018 International Conference on Management of Data. ACM: 2018 pp. 323\u2013336.","DOI":"10.1145\/3183713.3196931"},{"key":"e_1_3_4_110_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu288"},{"key":"e_1_3_4_111_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa472"}],"container-title":["Journal of Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/15578666261493564","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/15578666261493564","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/15578666261493564","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,9]],"date-time":"2026-10-09T16:54:46Z","timestamp":1791564886000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/15578666261493564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10,7]]},"references-count":110,"alternative-id":["10.1177\/15578666261493564"],"URL":"https:\/\/doi.org\/10.1177\/15578666261493564","relation":{},"ISSN":["1066-5277","1557-8666"],"issn-type":[{"value":"1066-5277","type":"print"},{"value":"1557-8666","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,10,7]]},"article-number":"15578666261493564"}}