{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T15:04:42Z","timestamp":1730214282149,"version":"3.28.0"},"reference-count":3,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/dcc.2004.1281502","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T14:19:45Z","timestamp":1086877185000},"page":"526-526","source":"Crossref","is-referenced-by-count":1,"title":["Fast searching over compressed text using a new coding technique: tagged sub-optimal code (TSC)"],"prefix":"10.1109","author":[{"given":"A.","family":"Bellaachia","sequence":"first","affiliation":[]},{"given":"I.A.L.","family":"Rassan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref3","first-page":"37","volume":"33","author":"ziviani","year":"2000","journal-title":"Compression A Key for Next-Generation Text Retrieval Systems IEEE Computer"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225288"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.1992.227453"}],"event":{"name":"Data Compression Conference, 2004. DCC 2004","location":"Snowbird, UT, USA"},"container-title":["Data Compression Conference, 2004. Proceedings. DCC 2004"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9014\/28614\/01281502.pdf?arnumber=1281502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T00:16:55Z","timestamp":1489450615000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1281502\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":3,"URL":"https:\/\/doi.org\/10.1109\/dcc.2004.1281502","relation":{},"subject":[]}}