{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:19:06Z","timestamp":1730279946623,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/iwcit.2019.8731626","type":"proceedings-article","created":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T19:22:13Z","timestamp":1559848933000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["The Statistical Dictionary-Based String Matching Problem"],"prefix":"10.1109","author":[{"given":"M.","family":"Suri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Rini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SPIRE.1998.712978"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195113679.001.0001","author":"apostolico","year":"1997","journal-title":"Pattern Matching Algorithms"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1162\/0891201042544938"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39984-1_5"},{"key":"ref11","first-page":"19","article-title":"Indexing methods for approximate string matching","volume":"24","author":"gonzalo","year":"2001","journal-title":"IEEE Data Eng Bull"},{"key":"ref5","volume":"463","author":"baeza-yates","year":"1999","journal-title":"Modern Information Retrieval"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526764"},{"key":"ref8","first-page":"525","article-title":"Inverted index compression for scalable image matching","author":"david","year":"2010","journal-title":"Proc Data Compression Conference (DCC)"},{"journal-title":"Information Retrieval Implementing and Evaluating Search Engines","year":"2016","author":"b\u00fcttcher","key":"ref7"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/B:INRT.0000048490.99518.5c","article-title":"Inverted index compression using word-aligned binary codes","volume":"8","author":"ngoc anh","year":"2005","journal-title":"Information Retrieval"},{"key":"ref9","volume":"331","author":"frakes","year":"1992","journal-title":"Information Retrieval Data Structures & Algorithms"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.1990.9999"}],"event":{"name":"2019 Iran Workshop on Communication and Information Theory (IWCIT)","start":{"date-parts":[[2019,4,24]]},"location":"Tehran, Iran","end":{"date-parts":[[2019,4,25]]}},"container-title":["2019 Iran Workshop on Communication and Information Theory (IWCIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8726000\/8731615\/08731626.pdf?arnumber=8731626","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T17:54:06Z","timestamp":1658080446000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8731626\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/iwcit.2019.8731626","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}