{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:03:56Z","timestamp":1742393036700},"reference-count":31,"publisher":"IEEE Computer. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2003.1238199","type":"proceedings-article","created":{"date-parts":[[2004,3,2]],"date-time":"2004-03-02T02:26:50Z","timestamp":1078194410000},"page":"251-260","source":"Crossref","is-referenced-by-count":3,"title":["Breaking a time-and-space barrier in constructing full-text indices"],"prefix":"10.1109","author":[{"family":"Wing-Kai Hon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Sadakane","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Wing-Kin Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"19","DOI":"10.1137\/0222058"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O"},{"key":"18","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/3-540-45655-4_43","article-title":"A space and time efficient algorithm for constructing compressed suffix arrays","author":"lam","year":"2002","journal-title":"Proceedings Computing and Combinatorics Conference"},{"key":"15","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/3-540-44888-8_14","article-title":"Linear-Time construction of suffix arrays","author":"kim","year":"2003","journal-title":"Proc 3rd Symp Combinatorial Pattern Matching"},{"key":"16","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-44888-8_15","article-title":"Space efficient linear time construction of suffix arrays","author":"ko","year":"2003","journal-title":"Proc 3rd Symp Combinatorial Pattern Matching"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1109\/SFCS.1989.63533"},{"key":"14","first-page":"943","article-title":"Simple linear work suffix array construction","author":"ka?rkka?nen","year":"2003","journal-title":"Proc Int Colloq Automata Languages Programming"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1006\/jagm.2001.1171"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1007\/3-540-45452-7_13"},{"doi-asserted-by":"publisher","key":"21","DOI":"10.1007\/978-3-642-69672-5"},{"doi-asserted-by":"publisher","key":"20","DOI":"10.1145\/321941.321946"},{"key":"22","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","article-title":"Tables","author":"munro","year":"1996","journal-title":"Proc 10th Conf Foundations Software Technology and Theoretical Computer Science"},{"year":"1979","author":"rice","article-title":"Some practical universal noiseless coding techniques","key":"23"},{"key":"24","first-page":"225","article-title":"Succinct representations of lcp information and improvements in the compressed suffix arrays","author":"sadakane","year":"2002","journal-title":"Proceedings of Symposium on Discrete Algorithms"},{"key":"25","article-title":"New text indexing functionalities of the compressed suffix arrays","author":"sadakane","year":"0","journal-title":"Journal of Algorithms"},{"year":"0","author":"seward","key":"26"},{"doi-asserted-by":"publisher","key":"27","DOI":"10.1007\/BF03037568"},{"doi-asserted-by":"publisher","key":"28","DOI":"10.1007\/BF01206331"},{"doi-asserted-by":"publisher","key":"29","DOI":"10.1109\/SWAT.1973.13"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1007\/s00453-001-0051-5"},{"year":"1994","author":"burrows","article-title":"A block-sorting lossless data compression algorithm","key":"2"},{"key":"10","first-page":"366","article-title":"Sorting and searching on the word RAM","author":"hagerup","year":"1998","journal-title":"Proc Symp Theoretical Aspects Comput Sci"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1145\/301250.301323"},{"doi-asserted-by":"publisher","key":"30","DOI":"10.1016\/0020-0190(83)90075-3"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1137\/S0097539702402354"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1137\/S0097539702402354"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1109\/SFCS.2000.892127"},{"doi-asserted-by":"publisher","key":"31","DOI":"10.1145\/234889.234891"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1109\/SFCS.1997.646102"},{"doi-asserted-by":"publisher","key":"9","DOI":"10.1017\/CBO9780511574931"},{"key":"8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5539-1","author":"grossman","year":"1998","journal-title":"Information Retrieval Algorithms and Heuristics"}],"event":{"acronym":"SFCS-03","name":"44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003","location":"Cambridge, MA, USA"},"container-title":["44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8767\/27770\/01238199.pdf?arnumber=1238199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T08:55:36Z","timestamp":1585644936000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1238199\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2003.1238199","relation":{},"subject":[]}}