{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:34:38Z","timestamp":1725503678164},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/dcc.2004.1281455","type":"proceedings-article","created":{"date-parts":[[2004,6,10]],"date-time":"2004-06-10T14:19:45Z","timestamp":1086877185000},"page":"102-111","source":"Crossref","is-referenced-by-count":0,"title":["Compressed index for dynamic text"],"prefix":"10.1109","author":[{"family":"Wing-Kai Hon","sequence":"first","affiliation":[]},{"family":"Tak-Wah Lam","sequence":"additional","affiliation":[]},{"given":"K.","family":"Sadakane","sequence":"additional","affiliation":[]},{"family":"Wing-Kin Sung","sequence":"additional","affiliation":[]},{"family":"Siu-Ming Yiu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"2003","author":"sadakane","journal-title":"Compressed Suffix Tree with Full Functionality","key":"15"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1109\/SFCS.1996.548491"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1137\/0222058"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1145\/321941.321946"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1007\/3-540-45452-7_13"},{"key":"12","first-page":"251","article-title":"Breaking a time-and-sapce barrier in constructing full-text indices","author":"hon","year":"2003","journal-title":"Proc Symp Foundations Computer Science"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1006\/inco.1995.1090"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1016\/S0022-0000(05)80047-9"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1145\/360825.360855"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1016\/0020-0190(92)90176-V"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1145\/301970.301973"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1137\/S0097539795286119"},{"key":"5","first-page":"531","article-title":"Fast incremental text editing","author":"ferragina","year":"1995","journal-title":"Proceedings of Symposium on Discrete Algorithms"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1007\/BF01185431"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1137\/S0097539702402354"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/SFCS.2000.892127"}],"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\/01281455.pdf?arnumber=1281455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T17:09:39Z","timestamp":1489511379000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1281455\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/dcc.2004.1281455","relation":{},"subject":[]}}