{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T06:44:45Z","timestamp":1776494685903,"version":"3.51.2"},"reference-count":11,"publisher":"Oxford University Press (OUP)","issue":"17","license":[{"start":{"date-parts":[[2017,5,4]],"date-time":"2017-05-04T00:00:00Z","timestamp":1493856000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/about_us\/legal\/notices"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Polish National Science Centre","doi-asserted-by":"publisher","award":["DEC-2015\/17\/B\/ST6\/01890"],"award-info":[{"award-number":["DEC-2015\/17\/B\/ST6\/01890"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007835","name":"Silesian University of Technology","doi-asserted-by":"publisher","award":["BKM507\/RAU2\/2016"],"award-info":[{"award-number":["BKM507\/RAU2\/2016"]}],"id":[{"id":"10.13039\/501100007835","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007835","name":"Silesian University of Technology","doi-asserted-by":"publisher","award":["POIG.02.03.01-24-099\/13"],"award-info":[{"award-number":["POIG.02.03.01-24-099\/13"]}],"id":[{"id":"10.13039\/501100007835","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,9,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:sec>\n                  <jats:title>Summary<\/jats:title>\n                  <jats:p>Counting all k-mers in a given dataset is a standard procedure in many bioinformatics applications. We introduce KMC3, a significant improvement of the former KMC2 algorithm together with KMC tools for manipulating k-mer databases. Usefulness of the tools is shown on a few real problems.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Availability and implementation<\/jats:title>\n                  <jats:p>Program is freely available at http:\/\/sun.aei.polsl.pl\/REFRESH\/kmc.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Supplementary information<\/jats:title>\n                  <jats:p>Supplementary data are available at Bioinformatics online.<\/jats:p>\n               <\/jats:sec>","DOI":"10.1093\/bioinformatics\/btx304","type":"journal-article","created":{"date-parts":[[2017,5,3]],"date-time":"2017-05-03T11:08:18Z","timestamp":1493809698000},"page":"2759-2761","source":"Crossref","is-referenced-by-count":700,"title":["KMC 3: counting and manipulating <i>k<\/i>-mer statistics"],"prefix":"10.1093","volume":"33","author":[{"given":"Marek","family":"Kokot","sequence":"first","affiliation":[{"name":"Institute of Informatics, Faculty of Automatic Control, Electronics and Computer Science, Silesian University of Technology, Gliwice, Poland"}]},{"given":"Maciej","family":"D\u0142ugosz","sequence":"additional","affiliation":[{"name":"Institute of Informatics, Faculty of Automatic Control, Electronics and Computer Science, Silesian University of Technology, Gliwice, Poland"}]},{"given":"Sebastian","family":"Deorowicz","sequence":"additional","affiliation":[{"name":"Institute of Informatics, Faculty of Automatic Control, Electronics and Computer Science, Silesian University of Technology, Gliwice, Poland"}]}],"member":"286","published-online":{"date-parts":[[2017,5,4]]},"reference":[{"key":"2023020206272120000_btx304-B1","author":"Deorowicz","year":"2013"},{"key":"2023020206272120000_btx304-B2","doi-asserted-by":"crossref","first-page":"1569","DOI":"10.1093\/bioinformatics\/btv022","article-title":"KMC 2: Fast and resource-frugal k-mer counting","volume":"31","author":"Deorowicz","year":"2015","journal-title":"Bioinformatics"},{"key":"2023020206272120000_btx304-B3","doi-asserted-by":"crossref","DOI":"10.1186\/s13015-017-0097-9","article-title":"Gerbil: a fast and memory-efficient k-mer counter with GPU-support","volume":"12","author":"Erbert","year":"2017","journal-title":"Algorithms Mol. Biol"},{"key":"2023020206272120000_btx304-B4","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1186\/s13742-015-0097-y","article-title":"GenomeTester4: a toolkit for performing basic set operations\u2014union, intersection and complement on k-mer lists","volume":"4","author":"Kaplinski","year":"2015","journal-title":"GigaScience"},{"key":"2023020206272120000_btx304-B5","author":"Kokot","year":"2016"},{"key":"2023020206272120000_btx304-B6","doi-asserted-by":"crossref","first-page":"2783","DOI":"10.1093\/bioinformatics\/btw345","article-title":"KCMBT: a k-mer counter based on multiple burst trees","volume":"32","author":"Mamun","year":"2016","journal-title":"Bioinformatics"},{"key":"2023020206272120000_btx304-B7","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1093\/bioinformatics\/btr011","article-title":"A fast, lock-free approach for efficient parallel counting of occurrences of k-mers","volume":"27","author":"Mar\u00e7ais","year":"2011","journal-title":"Bioinformatics"},{"key":"2023020206272120000_btx304-B8","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1038\/nbt.2515","article-title":"Mutation identification by direct comparison of whole-genome sequencing data from mutant and wild-type individuals using k-mers","volume":"31","author":"Nordstr\u00f6m","year":"2013","journal-title":"Nat. Biotechnol"},{"key":"2023020206272120000_btx304-B9","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1093\/bioinformatics\/btt020","article-title":"DSK: k-mer counting with very low memory usage","volume":"29","author":"Rizk","year":"2013","journal-title":"Bioinformatics"},{"key":"2023020206272120000_btx304-B10","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1002\/humu.22503","article-title":"DIAMUND: Direct comparison of genomes to detect mutations","volume":"35","author":"Salzberg","year":"2014","journal-title":"Hum. Mutat"},{"key":"2023020206272120000_btx304-B11","doi-asserted-by":"crossref","first-page":"160025.","DOI":"10.1038\/sdata.2016.25","article-title":"Extensive sequencing of seven human genomes to characterize benchmark reference materials","volume":"3","author":"Zook","year":"2016","journal-title":"Scientific Data"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/33\/17\/2759\/49040995\/bioinformatics_33_17_2759.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/33\/17\/2759\/49040995\/bioinformatics_33_17_2759.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T06:29:41Z","timestamp":1675319381000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/33\/17\/2759\/3796399"}},"subtitle":[],"editor":[{"given":"Bonnie","family":"Berger","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2017,5,4]]},"references-count":11,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2017,9,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btx304","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"value":"1367-4803","type":"print"},{"value":"1367-4811","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2017,9,1]]},"published":{"date-parts":[[2017,5,4]]}}}