{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:42Z","timestamp":1750307082693,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,9,4]],"date-time":"2012-09-04T00:00:00Z","timestamp":1346716800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,9,4]]},"DOI":"10.1145\/2361354.2361404","type":"proceedings-article","created":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T13:01:27Z","timestamp":1347454887000},"page":"227-236","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Full-text search on multi-byte encoded documents"],"prefix":"10.1145","author":[{"given":"Raymond K.","family":"Wong","sequence":"first","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}]},{"given":"Fengming","family":"Shi","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}]},{"given":"Nicole","family":"Lam","sequence":"additional","affiliation":[{"name":"University of New South Wales, Sydney, Australia"}]}],"member":"320","published-online":{"date-parts":[[2012,9,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009260"},{"key":"e_1_3_2_1_2_1","volume-title":"A block-sorting lossless data compression algorithm. Technical report","author":"Burrows M.","year":"1994","unstructured":"M. Burrows and D. Wheeler . A block-sorting lossless data compression algorithm. Technical report , Digital Equipment Corporation , Palo Alto, CA , 1994 . M. Burrows and D. Wheeler. A block-sorting lossless data compression algorithm. Technical report, Digital Equipment Corporation, Palo Alto, CA, 1994."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135891"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796543"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1082036.1082039"},{"key":"e_1_3_2_1_6_1","volume-title":"Information Retrieval: Data Structures & Algorithms","author":"Frakes W. B.","year":"1992","unstructured":"W. B. Frakes and R. A. Baeza-Yates , editors . Information Retrieval: Data Structures & Algorithms . Prentice-Hall , 1992 . W. B. Frakes and R. A. Baeza-Yates, editors. Information Retrieval: Data Structures & Algorithms. Prentice-Hall, 1992."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11780441_7"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/563801.563817"},{"key":"e_1_3_2_1_9_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-61332-3_155","volume-title":"J.-Y","author":"Karkkainen J.","year":"1996","unstructured":"J. Karkkainen and E. Ukkonen . Sparse suffix trees . In J.-Y . Cai and C. Wong, editors, Computing and Combinatorics, volume 1090 of Lecture Notes in Computer Science , pages 219 -- 230 . Springer Berlin \/ Heidelberg , 1996 . J. Karkkainen and E. Ukkonen. Sparse suffix trees. In J.-Y. Cai and C. Wong, editors, Computing and Combinatorics, volume 1090 of Lecture Notes in Computer Science, pages 219--230. Springer Berlin \/ Heidelberg, 1996."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp698"},{"issue":"1","key":"e_1_3_2_1_11_1","first-page":"40","article-title":"Succinct suffix arrays based on run-length encoding","volume":"12","author":"Makinen V.","year":"2005","unstructured":"V. Makinen and G. Navarro . Succinct suffix arrays based on run-length encoding . Nordic J. of Computing , 12 ( 1 ): 40 -- 66 , Mar. 2005 . V. Makinen and G. Navarro. Succinct suffix arrays based on run-length encoding. Nordic J. of Computing, 12(1):40--66, Mar. 2005.","journal-title":"Nordic J. of Computing"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/321941.321946"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(94)00108-N"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/789086.789649"},{"key":"e_1_3_2_1_17_1","volume-title":"Morgan Kaufmann","author":"Witten I.","year":"1999","unstructured":"I. Witten , A. Moffat , and T. Bell . Managing Gigabytes: Compressing and Indexing Documents and Images . Morgan Kaufmann , San Francisco, CA , 1999 . I. Witten, A. Moffat, and T. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, San Francisco, CA, 1999."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/789086.789666"}],"event":{"name":"DocEng '12: ACM Symposium on Document Engineering","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGDOC ACM Special Interest Group for Design of Communications"],"location":"Paris France","acronym":"DocEng '12"},"container-title":["Proceedings of the 2012 ACM symposium on Document engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2361354.2361404","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2361354.2361404","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:16Z","timestamp":1750239256000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2361354.2361404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,4]]},"references-count":17,"alternative-id":["10.1145\/2361354.2361404","10.1145\/2361354"],"URL":"https:\/\/doi.org\/10.1145\/2361354.2361404","relation":{},"subject":[],"published":{"date-parts":[[2012,9,4]]},"assertion":[{"value":"2012-09-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}