{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T13:33:10Z","timestamp":1790775190739,"version":"4.1.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030866914","type":"print"},{"value":"9783030866921","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86692-1_13","type":"book-chapter","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T17:24:41Z","timestamp":1632763481000},"page":"151-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["findere: Fast and Precise Approximate Membership Query"],"prefix":"10.1007","author":[{"given":"Lucas","family":"Robidou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Peterlongo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,9,27]]},"reference":[{"issue":"D1","key":"13_CR1","first-page":"D70","volume":"48","author":"C Amid","year":"2020","unstructured":"Amid, C., et al.: The European nucleotide archive in 2019. Nucleic Acids Res. 48(D1), D70\u2013D76 (2020)","journal-title":"Nucleic Acids Res."},{"issue":"11","key":"13_CR2","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.14778\/2350229.2350275","volume":"5","author":"MA Bender","year":"2012","unstructured":"Bender, M.A., et al.: Don\u2019t thrash: how to cache your hash on flash. Proc. VLDB Endow. 5(11), 1627\u20131637 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"e94","DOI":"10.7717\/peerj-cs.94","volume":"2","author":"G Benoit","year":"2016","unstructured":"Benoit, G., et al.: Multiple comparative metagenomics using multiset k-mer counting. PeerJ Comput. Sci. 2, e94 (2016)","journal-title":"PeerJ Comput. Sci."},{"issue":"7","key":"13_CR4","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":"5","key":"13_CR5","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1038\/nbt.3519","volume":"34","author":"NL Bray","year":"2016","unstructured":"Bray, N.L., Pimentel, H., Melsted, P., Pachter, L.: Near-optimal probabilistic RNA-SEQ quantification. Nat. Biotechnol. 34(5), 525\u2013527 (2016)","journal-title":"Nat. Biotechnol."},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3445967","volume":"54","author":"R Chikhi","year":"2021","unstructured":"Chikhi, R., Holub, J., Medvedev, P.: Data structures to represent a set of k -long DNA sequences. ACM Comput. Surv. 54(1), 1\u201322 (2021)","journal-title":"ACM Comput. Surv."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.D.: Cuckoo filter: practically better than bloom. In: Proceedings of the 10th ACM International on Conference on emerging Networking Experiments and Technologies, pp. 75\u201388 (2014)","DOI":"10.1145\/2674005.2674994"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"HMP Integrative, Proctor, L.M., et al.: The integrative human microbiome project. Nature 569(7758), 641\u2013648 (2019)","DOI":"10.1038\/s41586-019-1238-8"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1101\/gr.260604.119","volume":"31","author":"C Marchet","year":"2021","unstructured":"Marchet, C., Boucher, C., Puglisi, S.J., Medvedev, P., Salson, M., Chikhi, R.: Data structures based on k-mers for querying large collections of sequencing data sets. Genome Res. 31(1), 1\u201312 (2021)","journal-title":"Genome Res."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Marchet, C., Iqbal, Z., Gautheret, D., Salson, M., Chikhi, R.: REINDEER: efficient indexing of k-mer presence and abundance in sequencing datasets. Bioinformatics, 36(Supplement\\_1), i177\u2013i185 (2020)","DOI":"10.1093\/bioinformatics\/btaa487"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1186\/s13059-016-0997-x","volume":"17","author":"BD Ondov","year":"2016","unstructured":"Ondov, B.D., et al.: Mash: fast genome and metagenome distance estimation using MinHash. Genome Biol. 17(1), 132 (2016)","journal-title":"Genome Biol."},{"issue":"6","key":"13_CR12","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."},{"issue":"7","key":"13_CR13","doi-asserted-by":"publisher","first-page":"e1002195","DOI":"10.1371\/journal.pbio.1002195","volume":"13","author":"ZD Stephens","year":"2015","unstructured":"Stephens, Z.D., et al.: Big data: astronomical or genomical? PLOS Biol. 13(7), e1002195 (2015)","journal-title":"PLOS Biol."},{"issue":"3\u20134","key":"13_CR14","first-page":"129","volume":"8","author":"SA Weaver","year":"2014","unstructured":"Weaver, S.A., Ray, K.J., Marek, V.W., Mayer, A.J., Walker, A.K.: Satisfiability-based set membership filters. J. Satisf. Boolean Model. Comput. 8(3\u20134), 129\u2013148 (2014)","journal-title":"J. Satisf. Boolean Model. Comput."},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1186\/s13059-019-1891-0","volume":"20","author":"DE Wood","year":"2019","unstructured":"Wood, D.E., Jennifer, L., Langmead, B.: Improved metagenomic analysis with Kraken 2. Genome Biol. 20(1), 257 (2019). https:\/\/doi.org\/10.1186\/s13059-019-1891-0","journal-title":"Genome Biol."},{"issue":"1","key":"13_CR16","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1186\/s13059-017-1319-7","volume":"18","author":"A Zielezinski","year":"2017","unstructured":"Zielezinski, A., Vinga, S., Almeida, J., Karlowski, W.M.: Alignment-free sequence comparison: benefits, applications, and tools. Genome Biol. 18(1), 186 (2017). https:\/\/doi.org\/10.1186\/s13059-017-1319-7","journal-title":"Genome Biol."}],"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-030-86692-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T17:27:05Z","timestamp":1632763625000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86692-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030866914","9783030866921"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86692-1_13","relation":{"has-preprint":[{"id-type":"doi","id":"10.1101\/2021.05.31.446182","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Lille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spire2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cristal.univ-lille.fr\/spire2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.87","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.32","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 invited papers are also included. The symposium was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}