{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T19:59:38Z","timestamp":1769543978867,"version":"3.49.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["#IIS-1320078"],"award-info":[{"award-number":["#IIS-1320078"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["#IIS-1319909"],"award-info":[{"award-number":["#IIS-1319909"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007270","name":"University of Michigan","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007270","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007709","name":"Michigan State University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007709","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2020,3,1]]},"DOI":"10.1109\/tkde.2018.2885952","type":"journal-article","created":{"date-parts":[[2018,12,11]],"date-time":"2018-12-11T15:02:05Z","timestamp":1544540525000},"page":"602-616","source":"Crossref","is-referenced-by-count":4,"title":["VA-Store: A Virtual Approximate Store Approach to Supporting Repetitive Big Data in Genome Sequence Analyses"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5658-5875","authenticated-orcid":false,"given":"Xianying","family":"Liu","sequence":"first","affiliation":[{"name":"Department of Computer and Information Science, University of Michigan - Dearborn, Dearborn, MI, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7094-9236","authenticated-orcid":false,"given":"Qiang","family":"Zhu","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, University of Michigan - Dearborn, Dearborn, MI, USA"}]},{"given":"Sakti","family":"Pramanik","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA"}]},{"given":"C. Titus","family":"Brown","sequence":"additional","affiliation":[{"name":"Genome Center, University of California, Davis, CA, USA"}]},{"given":"Gang","family":"Qian","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Central Oklahoma, Edmond, OK, USA"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu047"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1125857.1125860"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1138394.1138395"},{"key":"ref31","first-page":"620","article-title":"The ND-tree: A dynamic indexing technique for multidimensional non-ordered discrete data spaces","author":"qian","year":"2003","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12683-3_28"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1128\/AEM.02829-07"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1038\/498255a","article-title":"Biology: The big challenges of big data","volume":"498","author":"vivien","year":"2013","journal-title":"Nature"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08326-1_48"},{"key":"ref34","article-title":"A new method to compute $k$k-mer frequencies and its application to annotate large repetitive plant genomes","volume":"9","author":"stefan","year":"2008","journal-title":"BMC Genomics"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.132"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt310"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.2023"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq697"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2164-14-641"},{"key":"ref15","first-page":"69","article-title":"Using disk based index and box queries for Genome sequencing error correction","author":"gu","year":"2016","journal-title":"Proc Int Conf Bioinf Comput Biol"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2808719.2811429"},{"key":"ref17","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$k-mers","volume":"27","author":"guillaume","year":"2011","journal-title":"Bioinf"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1093\/bioinformatics\/btt020","article-title":"DSK: $k$k-mer counting with very low memory usage","volume":"29","author":"guillaume","year":"2013","journal-title":"Bioinf"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14355-7_19"},{"key":"ref28","article-title":"Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing","volume":"13","author":"orenstein","year":"2017","journal-title":"Comput Biol"},{"key":"ref4","article-title":"Variable-order de Bruijn graphs","author":"boucher","year":"2014"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btt013"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2012.0021"},{"key":"ref6","first-page":"97","article-title":"DSIM: A distance-based indexing method for genomic sequences","author":"cao","year":"2005","journal-title":"Proc IEEE Symp Bioinf BioEng"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1121464109"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-10-421"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1365815.1365816"},{"key":"ref7","first-page":"4","article-title":"Indexing DNA sequences using q-grams","author":"cao","year":"2015","journal-title":"Proc Int Conf Database Syst Adv Appl"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.1990.9999"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2013.6691570"},{"key":"ref1","first-page":"1","article-title":"Efficient support of big data storage systems on the cloud","author":"akshay","year":"2013","journal-title":"Proc Workshop Cloud Comput Appl"},{"key":"ref20","first-page":"351","article-title":"Efficient index structures for string databases","author":"kahveci","year":"2001","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1101\/gr.229202. Article published online before March 2002"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2010-11-11-r116"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICCI-CC.2014.6921508"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367572"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1038\/nrg2626"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1038\/srep37243"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/69\/8985136\/8573155-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8985136\/08573155.pdf?arnumber=8573155","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T06:03:36Z","timestamp":1769493816000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8573155\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,1]]},"references-count":38,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2885952","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,1]]}}}