{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T09:28:58Z","timestamp":1769851738873,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"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_13","type":"book-chapter","created":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T16:05:35Z","timestamp":1587398735000},"page":"202-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Lower Density Selection Schemes via\u00a0Small Universal Hitting Sets with\u00a0Short Remaining Path Length"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7668-2090","authenticated-orcid":false,"given":"Hongyu","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0118-5516","authenticated-orcid":false,"given":"Carl","family":"Kingsford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5083-5925","authenticated-orcid":false,"given":"Guillaume","family":"Mar\u00e7ais","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,21]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1142\/S0218196704001700","volume":"14","author":"JM Champarnaud","year":"2004","unstructured":"Champarnaud, J.M., Hansel, G., Perrin, D.: Unavoidable sets of constant length. Int. J. Algebra Comput. 14(2), 241\u2013251 (2004). \nhttps:\/\/doi.org\/10.1142\/S0218196704001700","journal-title":"Int. J. Algebra Comput."},{"issue":"12","key":"13_CR2","doi-asserted-by":"publisher","first-page":"i201","DOI":"10.1093\/bioinformatics\/btw279","volume":"32","author":"R Chikhi","year":"2015","unstructured":"Chikhi, R., Limasset, A., Medvedev, P.: Compacting de Bruijn graphs from sequencing data quickly and in low memory. Bioinformatics 32(12), i201\u2013i208 (2015). \nhttps:\/\/doi.org\/10.1093\/bioinformatics\/btw279\n\n. \nhttps:\/\/academic.oup.com\/bioinformatics\/article\/32\/12\/i201\/2289008\/Compacting-de-Bruijn-graphs-from-sequencing-data","journal-title":"Bioinformatics"},{"key":"13_CR3","doi-asserted-by":"publisher","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, Niagara Falls, NY, USA, BCB 2019, pp. 167\u2013176. ACM, New York (2019). \nhttps:\/\/doi.org\/10.1145\/3307339.3342144\n\n. \nhttp:\/\/doi.acm.org\/10.1145\/3307339.3342144","DOI":"10.1145\/3307339.3342144"},{"issue":"10","key":"13_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). \nhttps:\/\/doi.org\/10.1093\/bioinformatics\/btv022\n\n. \nhttp:\/\/bioinformatics.oxfordjournals.org\/content\/31\/10\/1569","journal-title":"Bioinformatics"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-319-23826-5_28","volume-title":"String Processing and Information Retrieval","author":"S Grabowski","year":"2015","unstructured":"Grabowski, S., Raniszewski, M.: Sampling the suffix array with minimizers. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 287\u2013298. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23826-5_28"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-56970-3_5","volume-title":"Research in Computational Molecular Biology","author":"C Jain","year":"2017","unstructured":"Jain, C., Dilthey, A., Koren, S., Aluru, S., Phillippy, A.M.: A fast approximate algorithm for mapping long reads to large reference databases. In: Sahinalp, S.C. (ed.) RECOMB 2017. LNCS, vol. 10229, pp. 66\u201381. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-56970-3_5"},{"issue":"18","key":"13_CR7","doi-asserted-by":"publisher","first-page":"3094","DOI":"10.1093\/bioinformatics\/bty191","volume":"34","author":"H Li","year":"2018","unstructured":"Li, H., Birol, I.: Minimap2: pairwise alignment for nucleotide sequences. Bioinformatics 34(18), 3094\u20133100 (2018). \nhttps:\/\/doi.org\/10.1093\/bioinformatics\/bty191\n\n. \nhttps:\/\/academic.oup.com\/bioinformatics\/article\/34\/18\/3094\/4994778","journal-title":"Bioinformatics"},{"key":"13_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M Lothaire","year":"2002","unstructured":"Lothaire, M., Lothaire, M.: Algebraic Combinatorics on Words, vol. 90. Cambridge University Press, Cambridge (2002)"},{"issue":"13","key":"13_CR9","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). \nhttps:\/\/doi.org\/10.1093\/bioinformatics\/bty258\n\n. \nhttps:\/\/academic.oup.com\/bioinformatics\/article\/34\/13\/i13\/5045769","journal-title":"Bioinformatics"},{"issue":"14","key":"13_CR10","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). \nhttps:\/\/doi.org\/10.1093\/bioinformatics\/btx235\n\n. \nhttps:\/\/academic.oup.com\/bioinformatics\/article\/33\/14\/i110\/3953951","journal-title":"Bioinformatics"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1146\/annurev-biodatasci-072018-021156","volume":"2","author":"G Mar\u00e7ais","year":"2019","unstructured":"Mar\u00e7ais, G., Solomon, B., Patro, R., Kingsford, C.: Sketching and sublinear data structures in genomics. Ann. Rev. Biomed. Data Sci. 2(1), 93\u2013118 (2019). \nhttps:\/\/doi.org\/10.1146\/annurev-biodatasci-072018-021156","journal-title":"Ann. Rev. Biomed. Data Sci."},{"issue":"1","key":"13_CR12","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 Ser. B 13(1), 40\u201345 (1972). \nhttps:\/\/doi.org\/10.1016\/0095-8956(72)90006-8\n\n. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/0095895672900068","journal-title":"J. Comb. Theory Ser. B"},{"key":"13_CR13","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":"18","key":"13_CR14","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). \nhttps:\/\/doi.org\/10.1093\/bioinformatics\/bth408","journal-title":"Bioinformatics"},{"issue":"4","key":"13_CR15","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1089\/cmb.2004.11.734","volume":"11","author":"M Roberts","year":"2004","unstructured":"Roberts, M., Hunt, B.R., Yorke, J.A., Bolanos, R.A., Delcher, A.L.: A preprocessor for shotgun assembly of large genomes. J. Comput. Biol. 11(4), 734\u2013752 (2004). \nhttps:\/\/doi.org\/10.1089\/cmb.2004.11.734","journal-title":"J. Comput. Biol."},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Golomb, S.W.: Nonlinear shift register sequences. In: Shift Register Sequences, pp. 110\u2013168. World Scientific, September 2014. \nhttps:\/\/doi.org\/10.1142\/9789814632010_0006\n\n. \nhttp:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/9789814632010_0006","DOI":"10.1142\/9789814632010_0006"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Schleimer, S., Wilkerson, D.S., Aiken, A.: Winnowing: local algorithms for document fingerprinting. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, SIGMOD 2003, pp. 76\u201385. ACM (2003). \nhttps:\/\/doi.org\/10.1145\/872757.872770","DOI":"10.1145\/872757.872770"},{"key":"13_CR18","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., Yu, D.W.: Exploiting sparseness in de novo genome assembly. BMC Bioinform. 13, S1 (2012). \nhttps:\/\/doi.org\/10.1186\/1471-2105-13-S6-S1\n\n. \nhttp:\/\/www.biomedcentral.com\/1471-2105\/13\/S6\/S1\/abstract","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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,3]],"date-time":"2020-05-03T23:04:01Z","timestamp":1588547041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45257-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030452568","9783030452575"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45257-5_13","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":"C.K. is a co-founder of Ocean Genomics, Inc. G.M. is V.P. of software development at Ocean Genomics, Inc.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interests"}},{"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)"}}]}}