{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:54:37Z","timestamp":1725497677299},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/dcc.2005.37","type":"proceedings-article","created":{"date-parts":[[2005,4,12]],"date-time":"2005-04-12T10:25:58Z","timestamp":1113301558000},"page":"153-162","source":"Crossref","is-referenced-by-count":0,"title":["Efficient String Matching Algorithms for Combinatorial Universal Denoising"],"prefix":"10.1109","author":[{"given":"S.","family":"Chen","sequence":"first","affiliation":[]},{"given":"S.","family":"Diggavi","sequence":"additional","affiliation":[]},{"given":"S.","family":"Dusad","sequence":"additional","affiliation":[]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839518"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322237"},{"year":"0","author":"skiena","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646102"},{"key":"2","first-page":"185","article-title":"On the temporal HZY compression scheme","author":"cohen","year":"2000","journal-title":"ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"1","article-title":"Substring compression problems","author":"cormode","year":"2005","journal-title":"Proc ACM SODA"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405281"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1147\/rd.312.0249"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/800152.804905"},{"key":"5","first-page":"943","article-title":"Simple linear work suffix array construction","author":"karkkinen","year":"2003","journal-title":"Proc 30th International Colloquium on Automata Languages and Programming (ICALP '03)"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61258-0_11"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1015"},{"key":"8","first-page":"67","article-title":"Augmenting suffix trees, with applications","author":"matias","year":"1998","journal-title":"Proc Eur Symp Algorithms (ESA)"}],"event":{"name":"Data Compression Conference","location":"Snowbird, UT, USA"},"container-title":["Data Compression Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9633\/30443\/01402176.pdf?arnumber=1402176","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T00:13:45Z","timestamp":1489536825000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1402176\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/dcc.2005.37","relation":{},"subject":[]}}