{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:28:13Z","timestamp":1773278893490,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1186\/s13015-017-0097-9","type":"journal-article","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T01:13:00Z","timestamp":1490922780000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":60,"title":["Gerbil: a fast and memory-efficient\u00a0k-mer counter with GPU-support"],"prefix":"10.1186","volume":"12","author":[{"given":"Marius","family":"Erbert","sequence":"first","affiliation":[]},{"given":"Steffen","family":"Rechner","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"M\u00fcller-Hannemann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,31]]},"reference":[{"issue":"1","key":"97_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1756-0500-7-484","volume":"7","author":"BB Xavier","year":"2014","unstructured":"Xavier BB, Sabirova J, Pieter M, Hernalsteens J-P, de Greve H, Goossens H, Malhotra-Kumar S. Employing whole genome mapping for optimal de novo assembly of bacterial genomes. BMC Res Notes. 2014;7(1):1\u20134. doi: 10.1186\/1756-0500-7-484 .","journal-title":"BMC Res Notes"},{"issue":"1","key":"97_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1093\/bioinformatics\/btt310","volume":"30","author":"R Chikhi","year":"2014","unstructured":"Chikhi R, Medvedev P. Informed and automated k-mer size selection for genome assembly. Bioinformatics. 2014;30(1):31\u20137. doi: 10.1093\/bioinformatics\/btt310 .","journal-title":"Bioinformatics"},{"key":"97_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/bib\/bbw003","volume":"18","author":"K Sameith","year":"2016","unstructured":"Sameith K, Roscito JG, Hiller M. Iterative error correction of long sequencing reads maximizes accuracy and improves contig assembly. Brief Bioinform. 2016;18:1\u20138. doi: 10.1093\/bib\/bbw003 .","journal-title":"Brief Bioinform"},{"key":"97_CR4","doi-asserted-by":"crossref","unstructured":"Erbert M, Rechner S, M\u00fcller-Hannemann M. Gerbil: a fast and memory-efficient k-mer counter with gpu-support. In International workshop on algorithms in bioinformatics. Berllin: Springer; 2016. p. 150\u2013161.","DOI":"10.1007\/978-3-319-43681-4_12"},{"issue":"6","key":"97_CR5","doi-asserted-by":"crossref","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. 2011;27(6):764\u201370.","journal-title":"Bioinformatics"},{"issue":"1","key":"97_CR6","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 JK. Efficient counting of k-mers in DNA sequences using a bloom filter. BMC Bioinform. 2011;12(1):1\u20137. doi: 10.1186\/1471-2105-12-333 .","journal-title":"BMC Bioinform"},{"issue":"5","key":"97_CR7","doi-asserted-by":"crossref","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. 2013;29(5):652\u20133.","journal-title":"Bioinformatics"},{"issue":"1","key":"97_CR8","doi-asserted-by":"publisher","first-page":"1","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. 2013;14(1):1\u201312. doi: 10.1186\/1471-2105-14-160 .","journal-title":"BMC Bioinform"},{"issue":"14","key":"97_CR9","doi-asserted-by":"publisher","first-page":"1950","DOI":"10.1093\/bioinformatics\/btu132","volume":"30","author":"RS Roy","year":"2014","unstructured":"Roy RS, Bhattacharya D, Schliep A. Turtle: identifying frequent k-mers with cache-efficient algorithms. Bioinformatics. 2014;30(14):1950\u20137. doi: 10.1093\/bioinformatics\/btu132 .","journal-title":"Bioinformatics"},{"key":"97_CR10","unstructured":"Li Y, et al. MSPKmerCounter: a fast and memory efficient approach for k-mer counting. arXiv preprint arXiv:1505.06550 ; 2015."},{"issue":"10","key":"97_CR11","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. 2015;31(10):1569\u201376. doi: 10.1093\/bioinformatics\/btv022 .","journal-title":"Bioinformatics"},{"issue":"4","key":"97_CR12","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1089\/cmb.2015.0199","volume":"23","author":"N P\u00e9rez","year":"2016","unstructured":"P\u00e9rez N, Gutierrez M, Vera N. Computational performance assessment of k-mer counting algorithms. J Comput Biol. 2016;23(4):248\u201355.","journal-title":"J Comput Biol"},{"key":"97_CR13","first-page":"2783","volume":"345","author":"AA Mamun","year":"2015","unstructured":"Mamun AA, Pal S, Rajasekaran S. Kcmbt: a k-mer counter based on multiple burst trees. Bioinformatics. 2015;345:2783\u201390.","journal-title":"Bioinformatics"},{"key":"97_CR14","unstructured":"Suzuki S, Ishida T, Akiyama Y. Masanori\u00a0Kakuta: accelerating identification of frequent k-mers in DNA sequences with GPU. In: GTC; 2014."},{"issue":"4","key":"97_CR15","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1089\/cmb.2004.11.734","volume":"11","author":"M Roberts","year":"2004","unstructured":"Roberts M, Hunt BR, Yorke JA, Bolanos RA, Delcher AL. A preprocessor for shotgun assembly of large genomes. J Comput Biol. 2004;11(4):734\u201352.","journal-title":"J Comput Biol"},{"issue":"18","key":"97_CR16","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 BR, Mount SM, Yorke JA. Reducing storage requirements for biological sequence comparison. Bioinformatics. 2004;20(18):3363\u20139. doi: 10.1093\/bioinformatics\/bth408 .","journal-title":"Bioinformatics"},{"key":"97_CR17","doi-asserted-by":"crossref","first-page":"140045","DOI":"10.1038\/sdata.2014.45","volume":"1","author":"KE Kim","year":"2014","unstructured":"Kim KE, Peluso P, Babayan P, Yeadon PJ, Yu C, Fisher WW, Chin CS, Rapicavoli NA, Rank DR, Li J, et al. Long-read, whole-genome shotgun sequence data for five model organisms. Sci Data. 2014;1:140045.","journal-title":"Sci Data"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-017-0097-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T13:53:37Z","timestamp":1498398817000},"score":1,"resource":{"primary":{"URL":"http:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-017-0097-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,31]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["97"],"URL":"https:\/\/doi.org\/10.1186\/s13015-017-0097-9","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,31]]},"article-number":"9"}}