{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:49Z","timestamp":1760202649059,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/isit.2012.6283021","type":"proceedings-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T20:57:57Z","timestamp":1346360277000},"page":"1092-1096","source":"Crossref","is-referenced-by-count":3,"title":["On fast and memory-efficient construction of an antidictionary array"],"prefix":"10.1109","author":[{"given":"Hirotada","family":"Fukae","sequence":"first","affiliation":[]},{"given":"Takahiro","family":"Ota","sequence":"additional","affiliation":[]},{"given":"Hiroyoshi","family":"Morita","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","first-page":"516","article-title":"DCA Using Suffix Arrays","author":"fiala","year":"2008","journal-title":"Proc of Data Compression Conference (DCC2008)"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27801-6_11"},{"key":"10","first-page":"181","volume":"50","author":"kasai","year":"2001","journal-title":"Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/5.892711"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e90-a.11.2533"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00104-5"},{"key":"5","article-title":"A Block-Sorting Lossless Data Compression Algorithm","author":"burrows","year":"1994","journal-title":"SRC Research Report"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2010.5649621"},{"key":"9","article-title":"Simple Linear Work Suffix Array Construction","author":"ka?rkka?inen","year":"0","journal-title":"Proc of 13th International Conference on Automata Languages and Programming 2003"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033999"},{"journal-title":"Algorithms in C","year":"1990","author":"sedgewick","key":"11"},{"key":"12","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/978-3-642-03456-5_17","article-title":"Finding Nearest Larger Neighbors -A Case Study in Algorithm Design and Analysis-","volume":"5760","author":"asano","year":"2009","journal-title":"Lecture Notes in Computer Science"}],"event":{"name":"2012 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2012,7,1]]},"location":"Cambridge, MA, USA","end":{"date-parts":[[2012,7,6]]}},"container-title":["2012 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6268627\/6281806\/06283021.pdf?arnumber=6283021","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T23:28:32Z","timestamp":1498001312000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6283021\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2012.6283021","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}