{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T18:26:37Z","timestamp":1773858397577,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032052278","type":"print"},{"value":"9783032052285","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-05228-5_2","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:00:44Z","timestamp":1758474044000},"page":"10-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["KeBaB: k-mer Based Breaking for\u00a0Finding Long MEMs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6201-2301","authenticated-orcid":false,"given":"Nathaniel K.","family":"Brown","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8517-0479","authenticated-orcid":false,"given":"Lore","family":"Depuydt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9856-719X","authenticated-orcid":false,"given":"Mohsen","family":"Zakeri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anas","family":"Alhadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nour","family":"Allam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dove","family":"Begleiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nithin Bharathi Kabilan","family":"Karpagavalli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suchith Sridhar","family":"Khajjayam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamza","family":"Wahed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1825-0097","authenticated-orcid":false,"given":"Travis","family":"Gagie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2437-1976","authenticated-orcid":false,"given":"Ben","family":"Langmead","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,22]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1186\/s13059-023-02958-1","volume":"24","author":"OY Ahmed","year":"2023","unstructured":"Ahmed, O.Y., Rossi, M., Gagie, T., Boucher, C., Langmead, B.: SPUMONI 2: improved classification using a pangenome index of minimizer digests. Genome Biol. 24(1), 122 (2023)","journal-title":"Genome Biol."},{"issue":"7","key":"2_CR2","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"10","key":"2_CR3","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"RS Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM 20(10), 762\u2013772 (1977)","journal-title":"Commun. ACM"},{"key":"2_CR4","unstructured":"Depuydt, L., Renders, L., Van\u00a0de Vyver, S., Veys, L., Gagie, T., Fostier, J.: b-move: Faster lossless approximate pattern matching in a run-length compressed index. Algorithms for Molecular Biology (accepted)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Depuydt, L., Ahmed, O.Y., Fostier, J., Langmead, B., Gagie, T.: Run-length compressed metagenomic read classification with SMEM-finding and tagging. bioRxiv, pp. 2025\u201302 (2025)","DOI":"10.1101\/2025.02.25.640119"},{"issue":"4","key":"2_CR6","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1145\/1082036.1082039","volume":"52","author":"P Ferragina","year":"2005","unstructured":"Ferragina, P., Manzini, G.: Indexing compressed text. J. ACM 52(4), 552\u2013581 (2005)","journal-title":"J. ACM"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Fusy, \u00c9., Gandouet, O., Meunier, F.: HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm. Discrete Mathematics & Theoretical Computer Science (2007)","DOI":"10.46298\/dmtcs.3545"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Gagie, T.: How to find long maximal exact matches and ignore short ones. In: Proc. 28th Conference on Developments in Language Theory (DLT), pp. 131\u2013140 (2024)","DOI":"10.1007\/978-3-031-66159-4_10"},{"issue":"14","key":"2_CR9","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1093\/bioinformatics\/bts280","volume":"28","author":"H Li","year":"2012","unstructured":"Li, H.: Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly. Bioinformatics 28(14), 1838\u20131844 (2012)","journal-title":"Bioinformatics"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Li, H.: BWT construction and search at the terabase scale. Bioinformatics 40(12), btae717 (2024)","DOI":"10.1093\/bioinformatics\/btae717"},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1109\/TPDS.2018.2869889","volume":"30","author":"J Lu","year":"2018","unstructured":"Lu, J., et al.: Ultra-fast bloom filters using SIMD techniques. IEEE Trans. Parallel Distrib. Syst. 30(4), 953\u2013964 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"M\u00e4kinen, V., Belazzougui, D., Cunial, F., Tomescu, A.I.: Genome-scale algorithm design: bioinformatics in the era of high-throughput sequencing. Cambridge University Press (2023)","DOI":"10.1017\/9781009341257"},{"issue":"22","key":"2_CR13","doi-asserted-by":"publisher","first-page":"3492","DOI":"10.1093\/bioinformatics\/btw397","volume":"32","author":"H Mohamadi","year":"2016","unstructured":"Mohamadi, H., Chu, J., Vandervalk, B.P., Birol, I.: ntHash: recursive nucleotide hashing. Bioinformatics 32(22), 3492\u20133494 (2016)","journal-title":"Bioinformatics"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Navarro, G.: Compact data structures: A practical approach. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781316588284"},{"issue":"6","key":"2_CR15","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1089\/cmb.2016.0155","volume":"24","author":"D Pellow","year":"2017","unstructured":"Pellow, D., Filippova, D., Kingsford, C.: Improving bloom filter performance on sequence data using k-mer bloom filters. J. Comput. Biol. 24(6), 547\u2013557 (2017)","journal-title":"J. Comput. Biol."},{"key":"2_CR16","first-page":"4","volume":"14","author":"F Putze","year":"2010","unstructured":"Putze, F., Sanders, P., Singler, J.: Cache-, hash-, and space-efficient bloom filters. J. Exp. Alg. (JEA) 14, 4\u20134 (2010)","journal-title":"J. Exp. Alg. (JEA)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Robidou, L., Peterlongo, P.: findere: fast and precise approximate membership query. In: International Symposium on String Processing and Information Retrieval, pp. 151\u2013163. Springer (2021)","DOI":"10.1007\/978-3-030-86692-1_13"},{"issue":"7","key":"2_CR18","doi-asserted-by":"publisher","first-page":"1609","DOI":"10.1101\/gr.279858.124","volume":"35","author":"R Varki","year":"2025","unstructured":"Varki, R., et al.: Accurate short-read alignment through r-index-based pangenome indexing. Genome Res. 35(7), 1609\u20131620 (2025)","journal-title":"Genome Res."}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05228-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:00:46Z","timestamp":1758474046000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05228-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,22]]},"ISBN":["9783032052278","9783032052285"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05228-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,22]]},"assertion":[{"value":"22 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"SPIRE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on String Processing and Information Retrieval","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/spire-2025\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}