{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T11:51:20Z","timestamp":1781610680386,"version":"3.54.5"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030452568","type":"print"},{"value":"9783030452575","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45257-5_3","type":"book-chapter","created":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T16:05:35Z","timestamp":1587398735000},"page":"37-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["A Randomized Parallel Algorithm for Efficiently Finding Near-Optimal Universal Hitting Sets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4040-403X","authenticated-orcid":false,"given":"Bar\u0131\u015f","family":"Ekim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2724-7228","authenticated-orcid":false,"given":"Bonnie","family":"Berger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3583-3112","authenticated-orcid":false,"given":"Yaron","family":"Orenstein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,4,21]]},"reference":[{"issue":"5","key":"3_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1038\/nrg3433","volume":"14","author":"B Berger","year":"2013","unstructured":"Berger, B., Peng, J., Singh, M.: Computational solutions for omics data. Nat. Rev. Genet. 14(5), 333 (2013)","journal-title":"Nat. Rev. Genet."},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/S0022-0000(05)80068-6","volume":"49","author":"B Berger","year":"1994","unstructured":"Berger, B., Rompel, J., Shor, P.W.: Efficient NC algorithms for set cover with applications to learning and geometry. J. Comput. Syst. Sci. 49(3), 454\u2013477 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"DeBlasio, D., Gbosibo, F., Kingsford, C., Mar\u00e7ais, G.: Practical universal k-mer sets for minimizer schemes. In: Proceedings of the 10th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics, pp. 167\u2013176. ACM (2019)","DOI":"10.1145\/3307339.3342144"},{"issue":"10","key":"3_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":"3","key":"3_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9(3), 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"e0121453","DOI":"10.1371\/journal.pone.0121453","volume":"10","author":"J Kawulok","year":"2015","unstructured":"Kawulok, J., Deorowicz, S.: CoMeta: classification of metagenomes using k-mers. PLoS ONE 10(4), e0121453 (2015)","journal-title":"PLoS ONE"},{"issue":"19","key":"3_CR7","doi-asserted-by":"publisher","first-page":"3547","DOI":"10.1093\/bioinformatics\/btz272","volume":"35","author":"G Kucherov","year":"2019","unstructured":"Kucherov, G.: Evolution of biosequence search algorithms: a brief survey. Bioinformatics 35(19), 3547\u20133552 (2019)","journal-title":"Bioinformatics"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"D19","DOI":"10.1093\/nar\/gkq1019","volume":"39","author":"R Leinonen","year":"2010","unstructured":"Leinonen, R., Sugawara, H., Shumway, M., Collaboration, I.N.S.D.: The sequence read archive. Nucleic Acids Res. 39, D19\u2013D21 (2010)","journal-title":"Nucleic Acids Res."},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discret. Math. 13(4), 383\u2013390 (1975)","journal-title":"Discret. Math."},{"issue":"13","key":"3_CR10","doi-asserted-by":"publisher","first-page":"i13","DOI":"10.1093\/bioinformatics\/bty258","volume":"34","author":"G Mar\u00e7ais","year":"2018","unstructured":"Mar\u00e7ais, G., DeBlasio, D., Kingsford, C.: Asymptotically optimal minimizers schemes. Bioinformatics 34(13), i13\u2013i22 (2018)","journal-title":"Bioinformatics"},{"issue":"14","key":"3_CR11","doi-asserted-by":"publisher","first-page":"i110","DOI":"10.1093\/bioinformatics\/btx235","volume":"33","author":"G Mar\u00e7ais","year":"2017","unstructured":"Mar\u00e7ais, G., Pellow, D., Bork, D., Orenstein, Y., Shamir, R., Kingsford, C.: Improving the performance of minimizers and winnowing schemes. Bioinformatics 33(14), i110\u2013i117 (2017)","journal-title":"Bioinformatics"},{"key":"3_CR12","unstructured":"Mar\u00e7ais, G., Solomon, B., Patro, R., Kingsford, C.: Sketching and sublinear data structures in genomics. Ann. Rev. Biomed. Data Sci. 2, 93\u2013118 (2019)"},{"issue":"1","key":"3_CR13","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/0095-8956(72)90006-8","volume":"13","author":"J Mykkeltveit","year":"1972","unstructured":"Mykkeltveit, J.: A proof of Golomb\u2019s conjecture for the de Bruijn graph. J. Comb. Theory 13(1), 40\u201345 (1972)","journal-title":"J. Comb. Theory"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-319-43681-4_21","volume-title":"Algorithms in Bioinformatics","author":"Y Orenstein","year":"2016","unstructured":"Orenstein, Y., Pellow, D., Mar\u00e7ais, G., Shamir, R., Kingsford, C.: Compact universal k-mer hitting sets. In: Frith, M., Storm Pedersen, C.N. (eds.) WABI 2016. LNCS, vol. 9838, pp. 257\u2013268. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-43681-4_21"},{"issue":"10","key":"3_CR15","doi-asserted-by":"publisher","first-page":"e1005777","DOI":"10.1371\/journal.pcbi.1005777","volume":"13","author":"Y Orenstein","year":"2017","unstructured":"Orenstein, Y., Pellow, D., Mar\u00e7ais, G., Shamir, R., Kingsford, C.: Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing. PLoS Comput. Biol. 13(10), e1005777 (2017)","journal-title":"PLoS Comput. Biol."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-31301-6_2","volume-title":"Selected Areas in Cryptography \u2013 SAC 2015","author":"M Paindavoine","year":"2016","unstructured":"Paindavoine, M., Vialla, B.: Minimizing the number of bootstrappings in fully homomorphic encryption. In: Dunkelman, O., Keliher, L. (eds.) SAC 2015. LNCS, vol. 9566, pp. 25\u201343. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-31301-6_2"},{"issue":"7285","key":"3_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1038\/nature08821","volume":"464","author":"J Qin","year":"2010","unstructured":"Qin, J., et al.: A human gut microbial gene catalogue established by metagenomic sequencing. Nature 464(7285), 59 (2010)","journal-title":"Nature"},{"issue":"18","key":"3_CR18","doi-asserted-by":"publisher","first-page":"3363","DOI":"10.1093\/bioinformatics\/bth408","volume":"20","author":"M Roberts","year":"2004","unstructured":"Roberts, M., Hayes, W., Hunt, B.R., Mount, S.M., Yorke, J.A.: Reducing storage requirements for biological sequence comparison. Bioinformatics 20(18), 3363\u20133369 (2004)","journal-title":"Bioinformatics"},{"issue":"7164","key":"3_CR19","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1038\/nature06244","volume":"449","author":"PJ Turnbaugh","year":"2007","unstructured":"Turnbaugh, P.J., Ley, R.E., Hamady, M., Fraser-Liggett, C.M., Knight, R., Gordon, J.I.: The human microbiome project. Nature 449(7164), 804 (2007)","journal-title":"Nature"},{"issue":"6","key":"3_CR20","doi-asserted-by":"publisher","first-page":"S1","DOI":"10.1186\/1471-2105-13-S6-S1","volume":"13","author":"C Ye","year":"2012","unstructured":"Ye, C., Ma, Z.S., Cannon, C.H., Pop, M., Douglas, W.Y.: Exploiting sparseness in de novo genome assembly. BMC Bioinform. 13(6), S1 (2012)","journal-title":"BMC Bioinform."}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45257-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,3]],"date-time":"2020-05-03T23:02:46Z","timestamp":1588546966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45257-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030452568","9783030452575"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45257-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"21 April 2020","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":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.recomb2020.org\/","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":"24","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":"13","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":"0","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":"54% - 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","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":"9","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}