{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:38:33Z","timestamp":1729676313579,"version":"3.28.0"},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033999","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"2422-2426","source":"Crossref","is-referenced-by-count":1,"title":["On the dynamic construction of an antidictionary with linear complexity"],"prefix":"10.1109","author":[{"given":"Takahiro","family":"Ota","sequence":"first","affiliation":[]},{"given":"Hiroyoshi","family":"Morita","sequence":"additional","affiliation":[]},{"given":"Hirotada","family":"Fukae","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"516","article-title":"DCA using suffix arrays","author":"fiala","year":"2008","journal-title":"Proc of Data Compression Conference (DCC2008)"},{"key":"ref11","article-title":"A block-sorting lossless data compression algorithm","author":"burrows","year":"1994","journal-title":"SRC Research Report"},{"journal-title":"Dynamic construction of antidictionary array using suffix array","year":"2008","author":"fukae","key":"ref12"},{"journal-title":"Analysis of Algorithms","year":"1996","author":"sedgewick","key":"ref13"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2010.5649621"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00104-5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e90-a.11.2533"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.E93.D.3384"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206331"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205727"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-540-27801-6_11","article-title":"A Trie- Based approach for compacting automata","volume":"3109","author":"crochemore","year":"2004","journal-title":"Proc 15th Ann Symp Combinatorial Pattern Matching (CPM)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/5.892711"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.13"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06033999.pdf?arnumber=6033999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T03:35:15Z","timestamp":1497929715000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033999\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033999","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}