{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T20:18:52Z","timestamp":1672431532889},"reference-count":13,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0020-0190(01)00298-8","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"307-311","source":"Crossref","is-referenced-by-count":15,"title":["Time-space trade-offs for compressed suffix arrays"],"prefix":"10.1016","volume":"82","author":[{"given":"S.Srinivasa","family":"Rao","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00298-8_BIB001","series-title":"A block sorting lossless data compression algorithm, Technical Report 124","author":"Burrows","year":"1994"},{"key":"10.1016\/S0020-0190(01)00298-8_BIB002","series-title":"Proceedings of Symposium on Discrete Algorithms","first-page":"289","article-title":"A linear lower bound on index size for text retrieval","author":"Demaine","year":"2001"},{"issue":"2","key":"10.1016\/S0020-0190(01)00298-8_BIB003","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/321812.321820","article-title":"Efficient storage retrieval by content and address of static files","volume":"21","author":"Elias","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00298-8_BIB004","series-title":"Proceedings of Symposium on Foundations of Computer Science","first-page":"390","article-title":"Opportunistic data structures with applications","author":"Ferragina","year":"2000"},{"key":"10.1016\/S0020-0190(01)00298-8_BIB005","series-title":"Proceedings of Symposium on Discrete Algorithms","first-page":"269","article-title":"An experimental study of an opportunistic index","author":"Ferragina","year":"2001"},{"key":"10.1016\/S0020-0190(01)00298-8_BIB006","series-title":"Proceedings of Symposium on Theory of Computing","first-page":"397","article-title":"Compressed suffix arrays and suffix trees with applications to text indexing and string matching","author":"Grossi","year":"2000"},{"key":"10.1016\/S0020-0190(01)00298-8_BIB007","series-title":"Succinct static data structures, PhD Thesis","author":"Jacobson","year":"1989"},{"key":"10.1016\/S0020-0190(01)00298-8_BIB008","series-title":"Proceedings of Symposium on Combinatorial Pattern Matching","first-page":"305","article-title":"Compact suffix array","volume":"1848","author":"M\u00e4kinen","year":"2000"},{"issue":"5","key":"10.1016\/S0020-0190(01)00298-8_BIB009","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","article-title":"Suffix arrays: A new method for on-line string searches","volume":"22","author":"Manber","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00298-8_BIB010","series-title":"Proceedings of the Foundations of Software Technology and Theoretical Computer Science Conference","first-page":"37","article-title":"Tables","volume":"1180","author":"Munro","year":"1996"},{"issue":"2","key":"10.1016\/S0020-0190(01)00298-8_BIB011","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1006\/jagm.2000.1151","article-title":"Space efficient suffix trees","volume":"39","author":"Munro","year":"2001","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(01)00298-8_BIB012","series-title":"Proceedings of the International Symposium on Algorithms and Complexity","first-page":"410","article-title":"Compressed text databases with efficient query algorithms based on the compressed suffix array","volume":"1969","author":"Sadakane","year":"2000"},{"issue":"3","key":"10.1016\/S0020-0190(01)00298-8_BIB013","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"23","author":"Ziv","year":"1977","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002988?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002988?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T18:53:08Z","timestamp":1556650388000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0020019001002988"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00298-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}