{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T03:16:18Z","timestamp":1781752578182,"version":"3.54.5"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319436807","type":"print"},{"value":"9783319436814","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-43681-4_21","type":"book-chapter","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T10:51:35Z","timestamp":1470394295000},"page":"257-268","source":"Crossref","is-referenced-by-count":34,"title":["Compact Universal k-mer Hitting Sets"],"prefix":"10.1007","author":[{"given":"Yaron","family":"Orenstein","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Pellow","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guillaume","family":"Mar\u00e7ais","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ron","family":"Shamir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carl","family":"Kingsford","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,6]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, Heidelberg (2015)"},{"key":"21_CR2","doi-asserted-by":"crossref","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, 3363\u20133369 (2004)","journal-title":"Bioinformatics"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-61332-3_155","volume-title":"Computing and Combinatorics","author":"J Karkkainen","year":"1996","unstructured":"Karkkainen, J., Ukkonen, E.: Sparse suffix trees. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol. 1090, pp. 219\u2013230. Springer, Heidelberg (1996)"},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1038\/nbt.3442","volume":"34","author":"B Solomon","year":"2016","unstructured":"Solomon, B., Kingsford, C.: Fast search of thousands of short-read sequencing experiments. Nat. Biotechnol. 34, 300\u2013302 (2016)","journal-title":"Nat. Biotechnol."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Movahedi, N.S., Forouzmand, E., Chitsaz, H.: De novo co-assembly of bacterial genomes from multiple single cells. In: 2012 IEEE International Conference on Bioinformatics and Biomedicine (BIBM), pp. 1\u20135 (2012)","DOI":"10.1109\/BIBM.2012.6392618"},{"issue":"10","key":"21_CR6","doi-asserted-by":"crossref","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). Oxford Univ Press","journal-title":"Bioinformatics"},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1089\/cmb.2014.0160","volume":"22","author":"R Chikhi","year":"2015","unstructured":"Chikhi, R., Limasset, A., Jackman, S., Simpson, J.T., Medvedev, P.: On the representation of de Bruijn graphs. J. Comput. Biol. 22, 336\u2013352 (2015)","journal-title":"J. Comput. Biol."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Li, Y., Kamousi, P., Han, F., Yang, S., Yan, X., Suri, S.: Memory efficient minimum substring partitioning. In: Proceedings of the VLDB Endowment, vol. 6, pp. 169\u2013180. VLDB Endowment (2013)","DOI":"10.14778\/2535569.2448951"},{"key":"21_CR9","doi-asserted-by":"crossref","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, S1 (2012)","journal-title":"BMC Bioinform."},{"key":"21_CR10","doi-asserted-by":"crossref","first-page":"R46","DOI":"10.1186\/gb-2014-15-3-r46","volume":"15","author":"DE Wood","year":"2014","unstructured":"Wood, D.E., Salzberg, S.L.: Kraken: ultrafast metagenomic sequence classification using exact alignments. Genome Biol. 15, R46 (2014)","journal-title":"Genome Biol."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Sahinalp, S.C., Vishkin, U.: Efficient approximate and dynamic matching of patterns using a labeling paradigm. In: 37th Annual Symposium on Foundations of Computer Science, Proceedings, pp. 320\u2013328 (1996)","DOI":"10.1109\/SFCS.1996.548491"},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1093\/bioinformatics\/bts593","volume":"28","author":"F Hach","year":"2012","unstructured":"Hach, F., Numanagi, I., Alkan, C., Sahinalp, S.C.: SCALCE: boosting sequence compression algorithms using locally consistent encoding. Bioinformatics 28, 3051\u20133057 (2012)","journal-title":"Bioinformatics"},{"key":"21_CR13","doi-asserted-by":"crossref","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, 40\u201345 (1972)","journal-title":"J. Comb. Theory Ser. B"},{"key":"21_CR14","unstructured":"Knuth, D.E.: Unavoidable2 (2003). http:\/\/www-cs-faculty.stanford.edu\/uno\/programs\/unavoidable2.w"},{"key":"21_CR15","doi-asserted-by":"crossref","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, 241\u2013251 (2004)","journal-title":"Int. J. Algebra Comput."},{"key":"21_CR16","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4, 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"21_CR17","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/978-3-540-68279-0_8","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"RM Karp","year":"2010","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 219\u2013241. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-43681-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T16:03:56Z","timestamp":1498320236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-43681-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319436807","9783319436814"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43681-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}