{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T00:36:22Z","timestamp":1774312582048,"version":"3.50.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031902512","type":"print"},{"value":"9783031902529","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-90252-9_33","type":"book-chapter","created":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T20:03:57Z","timestamp":1745525037000},"page":"330-335","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Hyper-k-mers: Efficient Streaming k-mers Representation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-3007-6168","authenticated-orcid":false,"given":"Igor","family":"Martayan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8525-8157","authenticated-orcid":false,"given":"Lucas","family":"Robidou","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3137-1504","authenticated-orcid":false,"given":"Yoshihiro","family":"Shibuya","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0669-4141","authenticated-orcid":false,"given":"Antoine","family":"Limasset","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,25]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-05269-4_4","volume-title":"Research in Computational Molecular Biology","author":"R Chikhi","year":"2014","unstructured":"Chikhi, R., Limasset, A., Jackman, S., Simpson, J.T., Medvedev, P.: On the representation of de Bruijn graphs. In: Sharan, R. (ed.) Research in Computational Molecular Biology, pp. 35\u201355. Springer, Cham (2014)"},{"issue":"12","key":"33_CR2","doi-asserted-by":"publisher","first-page":"i201","DOI":"10.1093\/bioinformatics\/btw279","volume":"32","author":"R Chikhi","year":"2016","unstructured":"Chikhi, R., Limasset, A., Medvedev, P.: Compacting de Bruijn graphs from sequencing data quickly and in low memory. Bioinformatics 32(12), i201\u2013i208 (2016)","journal-title":"Bioinformatics"},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1186\/1471-2105-14-160","volume":"14","author":"S Deorowicz","year":"2013","unstructured":"Deorowicz, S., Debudaj-Grabysz, A., Grabowski, S.: Disk-based k-mer counting on a PC. BMC Bioinform. 14, 160 (2013)","journal-title":"BMC Bioinform."},{"issue":"10","key":"33_CR4","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1093\/bioinformatics\/btv022","volume":"31","author":"S Deorowicz","year":"2015","unstructured":"Deorowicz, S., Kokot, M., Grabowski, S., Debudaj-Grabysz, A.: KMC 2: fast and resource-frugal k-mer counting. Bioinformatics 31(10), 1569\u20131576 (2015)","journal-title":"Bioinformatics"},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1186\/s13015-024-00259-1","volume":"19","author":"D D\u00edaz-Dom\u00ednguez","year":"2024","unstructured":"D\u00edaz-Dom\u00ednguez, D., Leinonen, M., Salmela, L.: Space-efficient computation of k-mer dictionaries for large values of k. Algorithms Mol. Biol. 19(1), 14 (2024)","journal-title":"Algorithms Mol. Biol."},{"issue":"18","key":"33_CR6","doi-asserted-by":"publisher","first-page":"4423","DOI":"10.1093\/bioinformatics\/btac528","volume":"38","author":"Y Dufresne","year":"2022","unstructured":"Dufresne, Y., et al.: The k-mer file format: a standardized and compact disk representation of sets of k-mers. Bioinformatics 38(18), 4423\u20134425 (2022)","journal-title":"Bioinformatics"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"e10805","DOI":"10.7717\/peerj.10805","volume":"9","author":"R Edgar","year":"2021","unstructured":"Edgar, R.: Syncmers are more sensitive than minimizers for selecting conserved k-mers in biological sequences. PeerJ 9, e10805 (2021)","journal-title":"PeerJ"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13015-017-0097-9","volume":"12","author":"M Erbert","year":"2017","unstructured":"Erbert, M., Rechner, S., M\u00fcller-Hannemann, M.: Gerbil: a fast and memory-efficient k-mer counter with GPU-support. Algorithms Mol. Biol. 12, 1\u201312 (2017)","journal-title":"Algorithms Mol. Biol."},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Kokot, M., \u0131ugosz, M.D., Deorowicz, S.: KMC 3: counting and manipulating k-mer statistics. Bioinformatics 33(17), 2759\u20132761 (2017)","DOI":"10.1093\/bioinformatics\/btx304"},{"key":"33_CR10","unstructured":"Li, Y., et\u00a0al.: MSPKmerCounter: a fast and memory efficient approach for k-mer counting. arXiv preprint arXiv:1505.06550 (2015)"},{"issue":"18","key":"33_CR11","doi-asserted-by":"publisher","first-page":"2783","DOI":"10.1093\/bioinformatics\/btw345","volume":"32","author":"A-A Mamun","year":"2016","unstructured":"Mamun, A.-A., Pal, S., Rajasekaran, S.: KCMBT: a k-mer counter based on multiple burst trees. Bioinformatics 32(18), 2783\u20132790 (2016)","journal-title":"Bioinformatics"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Marchet, C., Limasset, A.: Scalable sequence database search using partitioned aggregated bloom comb trees. Bioinformatics 39(Supplement_1), i252\u2013i259 (2023)","DOI":"10.1093\/bioinformatics\/btad225"},{"issue":"6","key":"33_CR13","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1093\/bioinformatics\/btr011","volume":"27","author":"G Mar\u00e7ais","year":"2011","unstructured":"Mar\u00e7ais, G., Kingsford, C.: A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics 27(6), 764\u2013770 (2011)","journal-title":"Bioinformatics"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-12-333","volume":"12","author":"P Melsted","year":"2011","unstructured":"Melsted, P., Pritchard, J.K.: Efficient counting of k-mers in DNA sequences using a bloom filter. BMC Bioinform. 12, 1\u20137 (2011)","journal-title":"BMC Bioinform."},{"key":"33_CR15","unstructured":"Myers, G.: FASTK: a fast K-mer counter for high-fidelity shotgun datasets. https:\/\/github.com\/thegenemyers\/FASTK"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Pandey, P., Bender, M.A., Johnson, R., Patro., R.: A general-purpose counting filter: making every bit count. In: Proceedings of the 2017 ACM International Conference on Management of Data, pp. 775\u2013787 (2017)","DOI":"10.1145\/3035918.3035963"},{"issue":"4","key":"33_CR17","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1093\/bioinformatics\/btx636","volume":"34","author":"P Pandey","year":"2018","unstructured":"Pandey, P., Bender, M.A., Johnson, R., Patro, R.: Squeakr: an exact and approximate k-mer counting system. Bioinformatics 34(4), 568\u2013575 (2018)","journal-title":"Bioinformatics"},{"issue":"5","key":"33_CR18","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1093\/bioinformatics\/btt020","volume":"29","author":"G Rizk","year":"2013","unstructured":"Rizk, G., Lavenier, D., Chikhi, R.: DSK: k-mer counting with very low memory usage. Bioinformatics 29(5), 652\u2013653 (2013)","journal-title":"Bioinformatics"},{"issue":"14","key":"33_CR19","doi-asserted-by":"publisher","first-page":"1950","DOI":"10.1093\/bioinformatics\/btu132","volume":"30","author":"RS Roy","year":"2014","unstructured":"Roy, R.S., Bhattacharya, D., Schliep, A.: Turtle: identifying frequent k-mers with cache-efficient algorithms. Bioinformatics 30(14), 1950\u20131957 (2014)","journal-title":"Bioinformatics"},{"issue":"1","key":"33_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1186\/s13015-023-00227-1","volume":"18","author":"S Schmidt","year":"2023","unstructured":"Schmidt, S., Alanko, J.N.: Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time. Algorithms Mol. Biol. 18(1), 5 (2023)","journal-title":"Algorithms Mol. Biol."},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Shibuya, Y., Belazzougui, D., Kucherov., G.: Efficient reconciliation of genomic datasets of high similarity. In: 22nd International Workshop on Algorithms in Bioinformatics (WABI 2022), pp. 14:1\u201314:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)","DOI":"10.1101\/2022.06.07.495186"},{"key":"33_CR22","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-Leibniz-Zentrum f\u00fcr Informatik (2022)"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-90252-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T20:04:00Z","timestamp":1745525040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90252-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031902512","9783031902529"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90252-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"25 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Research in Computational Molecular Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","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":"26 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recomb.org\/recomb2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}