{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T22:50:07Z","timestamp":1754261407448,"version":"3.28.0"},"reference-count":104,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1109\/bibm.2018.8621325","type":"proceedings-article","created":{"date-parts":[[2019,2,28]],"date-time":"2019-02-28T22:32:01Z","timestamp":1551393121000},"page":"2561-2567","source":"Crossref","is-referenced-by-count":5,"title":["K-mer Counting: memory-efficient strategy, parallel computing and field of application for Bioinformatics"],"prefix":"10.1109","author":[{"given":"Ming","family":"Xiao","sequence":"first","affiliation":[]},{"given":"Jiakun","family":"Li","sequence":"additional","affiliation":[]},{"given":"Song","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Yongtao","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Junhua","family":"Li","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Wenbiao","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Le","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1063\/1.4991246"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1038\/nbt0406-423"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260785"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-016-0997-x"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.94"},{"key":"ref37","first-page":"22","article-title":"Towards simultaneous clustering and motif-modeling for a large number of protein family","author":"yoo","year":"2014","journal-title":"IEEE International Conference on Bioinformatics and Biomedicine"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr014"},{"key":"ref35","article-title":"Hierarchical clustering of DNA k-mer counts in RNA-seq fastq files reveals batch effects","author":"kaisers","year":"2014","journal-title":"Quantitative Biology"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/16.5.451"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-13-S19-S10"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.1990.9999"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw312"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1186\/1748-7188-8-22","article-title":"Space-efficient and exact de bruijn graph representation based on a bloom filter","volume":"8","author":"rizk","year":"2013","journal-title":"Algorithms for Molecular Biology AMB"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bts174"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1101\/gr.126953.111"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.171285098"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1101\/gr.074492.107"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0001022"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-10-S1-S12"},{"key":"ref100","first-page":"355","article-title":"ABSENT SEQUENCES NULLOMERS AND PRIMES","volume":"12","author":"hampikian","year":"2007","journal-title":"Pac Symp Biocomput"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt310"},{"key":"ref50","article-title":"MSPKmerCounter: A Fast and Memory Efficient Approach for K-mer Counting","author":"li","year":"2015","journal-title":"Computer Science"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt020"},{"key":"ref59","first-page":"823","article-title":"An optimal Bloom filter replacement","author":"pagh","year":"2005","journal-title":"Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms"},{"key":"ref58","first-page":"181","article-title":"Fast hash table lookup using extended bloom filter:an aid to network processing","author":"song","year":"2005"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20208"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref55","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1186\/1471-2164-9-517","article-title":"A new method to compute K-mer frequencies and its application to annotate large repetitive plant genomes","volume":"9","author":"apurva","year":"2008","journal-title":"BMC Genomics"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth408"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1385\/0896032469"},{"key":"ref52","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":"kingsford","year":"2011","journal-title":"Bioinformatics"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1128\/JVI.01244-13"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.plrev.2017.01.007"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/8917258"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1186\/s12864-016-3256-3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1093\/jmcb\/mjx056"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1039\/C6NR01637E"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-12-333"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3390\/molecules22122209"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu133"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s00018-003-3088-6"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkt144"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1003711"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.gene.2014.05.043"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/BIBE.2013.6701575"},{"key":"ref41","first-page":"233","article-title":"Phylogenetic analysis. Models and estimation procedures","volume":"19","author":"cavalli-sforza","year":"1967","journal-title":"American Journal of Human Genetics"},{"key":"ref44","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.jtbi.2015.09.014","article-title":"Rare k-mer DNA: Identification of sequence motifs and prediction of CpG Island and promoter","volume":"387","author":"kamil","year":"2015","journal-title":"Journal of Theoretical Biology"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq020"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu152"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx304"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btv022"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1101\/gr.089532.108"},{"journal-title":"Scalable Parallel Computing Technology Architecture Programming","year":"1998","author":"kai","key":"ref76"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675732"},{"key":"ref74","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/3-540-36108-1_18","article-title":"A Practical Multi-word Compare-and-Swap Operation","author":"harris","year":"2002","journal-title":"International Conference on Distributed Computing"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2015.0199"},{"key":"ref78","first-page":"275","article-title":"Using MPI: portable parallel programming with the message-passing interface","volume":"5","author":"gropp","year":"1994","journal-title":"Scientific Programming"},{"journal-title":"Effective Parallel MulticoreOptimized K-mers Counting Algorithm","year":"2016","author":"farka\u0161","key":"ref79"},{"key":"ref60","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/15427951.2004.10129096","article-title":"Network Applications of Bloom Filters: A Survey","volume":"1","author":"mitzenmacher","year":"2004","journal-title":"Internet Mathematics"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.12688\/f1000research.6924.1"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu132"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-8667(03)00065-0"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw345"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/506309.506312"},{"key":"ref68","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1005813.1041517","article-title":"Cache-conscious sorting of large sets of strings with dynamic tries","volume":"9","author":"sinha","year":"2004","journal-title":"Journal of Experimental Algorithmics"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1002021"},{"year":"2011","key":"ref69","article-title":"google-sparsehash - An extremely memory-efficient hash_map implementation"},{"key":"ref1","first-page":"1","article-title":"Efficient techniques for kmer counting","author":"mamun","year":"2015","journal-title":"IEEE International Conference on Computational Advances in Bio and Medical Sciences"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1145\/2103380.2103444"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367562"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496972"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"journal-title":"Transposing Relations From Maybe Functions to Hash Tables","year":"2004","author":"oliveira","key":"ref91"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(87)90689-9"},{"journal-title":"The Inflatable Transpose Tree a highly compact data structure","year":"2016","author":"doyle","key":"ref90"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0164540"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-9-167"},{"key":"ref98","first-page":"158","article-title":"Architecture for fast object detection supporting CPU-GPU hybrid and distributed computing","author":"bae","year":"2017","journal-title":"IEEE International Conference on Consumer Electronics"},{"key":"ref99","first-page":"2025","article-title":"A GPU-enabled Face Detection System in the Hadoop Platform Considering Big Data for Images","volume":"22","author":"bae","year":"2016"},{"key":"ref96","first-page":"1","article-title":"Hadoop: the definitive guide","volume":"215","author":"white","year":"2009","journal-title":"O'reilly Media Inc Gravenstein Highway North"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/ICIS.2014.6912154"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2002.1016901"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.85.8.2444"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75183-0_26"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/RAIT.2012.6194455"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/hmg\/ddq416"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/5.3.237"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"6s","DOI":"10.1038\/nmeth.1376","article-title":"Sense from sequence reads: methods for alignment and assembly","volume":"6","year":"2009","journal-title":"Nature Methods"},{"key":"ref82","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1186\/s12859-017-1881-8","article-title":"K-mer clustering algorithm using a MapReduce framework: application to the parallelization of the Inchworm module of Trinity","volume":"18","author":"chang","year":"2017","journal-title":"BMC Bioinformatics"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl629"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm451"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/VISUAL.2003.1250384"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2012.0021"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/ICACCE.2015.68"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1145\/2975167.2975211"},{"key":"ref89","first-page":"397","article-title":"The PH-Tree - A Space Efficient Storage Structure And Multi-Dimensional Index","author":"z\u00e4schke","year":"2014"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43681-4_12"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC-SmartCity-DSS.2017.57"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/HPCC.and.EUC.2013.156"},{"key":"ref88","first-page":"1","article-title":"Scalable Parallel Programming with CUDA","volume":"6","author":"john","year":"2008","journal-title":"Queue"}],"event":{"name":"2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)","start":{"date-parts":[[2018,12,3]]},"location":"Madrid, Spain","end":{"date-parts":[[2018,12,6]]}},"container-title":["2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8609864\/8621069\/08621325.pdf?arnumber=8621325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,28]],"date-time":"2020-11-28T23:44:39Z","timestamp":1606607079000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8621325\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":104,"URL":"https:\/\/doi.org\/10.1109\/bibm.2018.8621325","relation":{},"subject":[],"published":{"date-parts":[[2018,12]]}}}