{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:37:44Z","timestamp":1761709064217,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1109\/icalip.2014.7009935","type":"proceedings-article","created":{"date-parts":[[2015,1,20]],"date-time":"2015-01-20T02:47:14Z","timestamp":1421722034000},"page":"952-955","source":"Crossref","is-referenced-by-count":1,"title":["K-means clustering based compression algorithm for the high-throughput DNA sequence"],"prefix":"10.1109","author":[{"given":"Li","family":"Tan","sequence":"first","affiliation":[]},{"given":"Jifeng","family":"Sun","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/11496656_17","article-title":"DNA compression challenge revisited: A dynamic programming approach","author":"behzadi","year":"2005","journal-title":"Proc 14th Ann Symp Combinatorial Pattern Matching"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/1055709.1055711"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.12.1696"},{"year":"0","key":"14"},{"key":"11","first-page":"381","article-title":"Compressing huffman models on large alphabets","author":"gonzalo","year":"2013","journal-title":"Data Compression Conference (DCC) 2013"},{"journal-title":"Predicting DNA Sequences Using A Backoff Lan-guage Model","year":"0","author":"osborne","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.273055"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1993.253115"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/IAdCC.2013.6514310"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ISDEA.2012.21"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkr009"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr014"},{"key":"5","first-page":"91","article-title":"Optimized relative lempel-ziv compression of genomes","author":"kuruppu","year":"2011","journal-title":"Proceeding of the 34th Australasian Computer Science Conference"},{"key":"4","first-page":"513","article-title":"Intelligent DNA sequence data compression using memetic algorithm","volume":"41","author":"zhou","year":"2013","journal-title":"Acta Electronica Sinica"},{"key":"9","first-page":"32","article-title":"Investigating the particle swarm optimization clustering method on nucleic acid sequences","volume":"1","author":"baridam","year":"2011","journal-title":"International Journal of Jnnovative Technology & Creative Engineering"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2011.82"}],"event":{"name":"2014 International Conference on Audio, Language and Image Processing (ICALIP)","start":{"date-parts":[[2014,7,7]]},"location":"Shanghai, China","end":{"date-parts":[[2014,7,9]]}},"container-title":["2014 International Conference on Audio, Language and Image Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6996663\/7009743\/07009935.pdf?arnumber=7009935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T21:42:27Z","timestamp":1566250947000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7009935\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/icalip.2014.7009935","relation":{},"subject":[],"published":{"date-parts":[[2014,7]]}}}