{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T13:39:16Z","timestamp":1762781956288},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662491911"},{"type":"electronic","value":"9783662491928"}],"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-662-49192-8_38","type":"book-chapter","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T10:47:27Z","timestamp":1452163647000},"page":"469-477","source":"Crossref","is-referenced-by-count":2,"title":["Effective Parallel Multicore-Optimized K-mers Counting Algorithm"],"prefix":"10.1007","author":[{"given":"Tom\u00e1\u0161","family":"Farka\u0161","sequence":"first","affiliation":[]},{"given":"Peter","family":"Kub\u00e1n","sequence":"additional","affiliation":[]},{"given":"M\u00e1ria","family":"Luck\u00e1","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"issue":"14","key":"38_CR1","doi-asserted-by":"publisher","first-page":"2070","DOI":"10.1093\/bioinformatics\/btu152","volume":"30","author":"Peter Audano","year":"2014","unstructured":"Audano, P., Vannberg, F.: Kanalyze: a fast versatile pipelined k-mer toolkit. Bioinformatics (2014). doi:\n                      10.1093\/bioinformatics\/btu152\n                      \n                    . Accessed 18 March 2014","journal-title":"Bioinformatics"},{"issue":"7","key":"38_CR2","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). doi:\n                      10.1145\/362686.362692","journal-title":"Commun. ACM"},{"issue":"1","key":"38_CR3","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 30(1), 31\u201337 (2014)","journal-title":"Bioinformatics"},{"issue":"11","key":"38_CR4","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1038\/nbt.2023","volume":"29","author":"PE Compeau","year":"2011","unstructured":"Compeau, P.E., Pevzner, P.A., Tesler, G.: How to apply de Bruijn graphs to genome assembly. Nat. Biotechnol. 29(11), 987\u2013991 (2011). doi:\n                      10.1038\/nbt.2023","journal-title":"Nat. Biotechnol."},{"key":"38_CR5","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn., pp. 174\u2013177. MIT Press and McGraw-Hill, Cambridge, New York (2001). ISBN: 0-262-03293-7. Section 8.4: Bucket sort"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"160","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 Bioinf. 14, 160 (2013)","journal-title":"BMC Bioinf."},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Deorowicz, S., Kokot, M., Grabowski, S., Debudaj, A.: KMC 2: fast and resource-frugal k-mer counting. abs\/1407.1507 (2014)","DOI":"10.1093\/bioinformatics\/btv022"},{"key":"38_CR8","unstructured":"Edgar, G., Fagg, G.E., Bosilca, G.: Open MPI: goals, concept, and design of a next generation mpi implementation. In: Proceedings: 11th European PVM\/MPI Users\u2019 Group Meeting, Budapest, Hungary (2004)"},{"key":"38_CR9","unstructured":"Farka\u0161, T.: Parallel Bucket sort algorithm for ordering short DNA sequences. In: IIT.SRC 2015: Student Research Conference, Bratislava, pp. 77\u201382 (2015). ISBN: 978-80-227-4342-6"},{"key":"38_CR10","unstructured":"Hollerith, H.: US. pat. Nr. 395781, 395782, 395783"},{"issue":"6","key":"38_CR11","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1093\/bioinformatics\/btr011","volume":"27","author":"G Marais","year":"2011","unstructured":"Marais, G., Kingsford, C.: A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics 27(6), 764\u2013770 (2011)","journal-title":"Bioinformatics"},{"issue":"1","key":"38_CR12","first-page":"5","volume":"6","author":"PM McIlroy","year":"1993","unstructured":"McIlroy, P.M., et al.: Engineering radix sort. Comput. Syst. 6(1), 5\u201327 (1993)","journal-title":"Comput. Syst."},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1186\/1471-2105-12-333","volume":"12","author":"P Melsted","year":"2011","unstructured":"Melsted, P., Pritchard, J.K.: Efficient counting of k-mers in DNA sequences using a bloom filter. BMC Bioinform. 12, 333 (2011)","journal-title":"BMC Bioinform."},{"issue":"17","key":"38_CR14","doi-asserted-by":"publisher","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"PA Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H., Waterman, M.S.: An eulerian path approach to DNA fragment assembly. Proc. Nat. Acad. Sci. U.S.A. 98(17), 9748\u20139753 (2001)","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"issue":"5","key":"38_CR15","doi-asserted-by":"publisher","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 29(5), 652\u2013653 (2013)","journal-title":"Bioinformatics"},{"issue":"14","key":"38_CR16","doi-asserted-by":"publisher","first-page":"1950","DOI":"10.1093\/bioinformatics\/btu132","volume":"30","author":"Rajat Shuvro Roy","year":"2014","unstructured":"Roy, R.S., Bhattacharya, D., Schliep, A.: Turtle: identifying frequent k-mers with cache-efficient algorithms. Bioinformatics (2014). doi:\n                      10.1093\/bioinformatics\/btu132","journal-title":"Bioinformatics"},{"issue":"10","key":"38_CR17","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1038\/nbt1486","volume":"26","author":"J Shendure","year":"2008","unstructured":"Shendure, J., Ji, H.: Next-generation DNS sequencing. Nat. Biotechnol. 26(10), 1135\u20131145 (2008)","journal-title":"Nat. Biotechnol."},{"issue":"7","key":"38_CR18","doi-asserted-by":"publisher","first-page":"e101271","DOI":"10.1371\/journal.pone.0101271","volume":"9","author":"Q Zhang","year":"2014","unstructured":"Zhang, Q., Pell, J., Canino-Koning, R., Howe, A.C., Brown, C.T.: These are not the k-mers you are looking for: efficient online k-mer counting using a probabilistic data structure. PLoS ONE 9(7), e101271 (2014). doi:\n                      10.1371\/journal.pone.0101271","journal-title":"PLoS ONE"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2016: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49192-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T04:52:14Z","timestamp":1559364734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49192-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662491911","9783662491928"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49192-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}