{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T13:14:13Z","timestamp":1695129253847},"reference-count":17,"publisher":"Elsevier BV","issue":"5","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)00275-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:47:40Z","timestamp":1027615660000},"page":"253-259","source":"Crossref","is-referenced-by-count":8,"title":["Online timestamped text indexing"],"prefix":"10.1016","volume":"82","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[]},{"given":"Gad M.","family":"Landau","sequence":"additional","affiliation":[]},{"given":"Esko","family":"Ukkonen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00275-7_BIB001","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF02126797","article-title":"A lower bound for finding predecessors in Yao's cell probe model","volume":"8","author":"Ajtai","year":"1988","journal-title":"Combinatorica"},{"issue":"2","key":"10.1016\/S0020-0190(01)00275-7_BIB002","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0222017","article-title":"Recursive star-tree parallel data-structure","volume":"22","author":"Berkman","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00275-7_BIB003","series-title":"Proc. 6th Annual ACM\u2013SIAM Symposium On Discrete Algorithms","first-page":"263","article-title":"Algorithms for dynamic closest pair and n-body potential fields","author":"Callahan","year":"1995"},{"key":"10.1016\/S0020-0190(01)00275-7_BIB004","series-title":"Combinatorial Algorithms on Words","first-page":"97","article-title":"Efficient and elegant subword tree construction","author":"Chen","year":"1985"},{"key":"10.1016\/S0020-0190(01)00275-7_BIB005","series-title":"Proc. 10th ACM\u2013SIAM Symposium on Discrete Algorithms (SODA)","first-page":"235","article-title":"Dynamic LCA queries in trees","author":"Cole","year":"1999"},{"key":"10.1016\/S0020-0190(01)00275-7_BIB006","series-title":"Proc. 38th IEEE Symposium on Foundations of Computer Science","first-page":"137","article-title":"Optimal suffix tree construction with large alphabets","author":"Farach","year":"1997"},{"issue":"3","key":"10.1016\/S0020-0190(01)00275-7_BIB007","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/S0097539795286119","article-title":"Optimal on-line search and sublinear time update in string matching","volume":"27","author":"Ferragina","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00275-7_BIB008","series-title":"Proc. 16th ACM Symposium on Theory of Computing, Vol. 67","first-page":"135","article-title":"Scaling and related techniques for geometry problems","author":"Gabow","year":"1984"},{"key":"10.1016\/S0020-0190(01)00275-7_BIB009","first-page":"338","article-title":"Fast algorithms for finding nearest common ancestor","volume":"13","author":"Harel","year":"1984","journal-title":"Comput. Syst. Sci."},{"key":"10.1016\/S0020-0190(01)00275-7_BIB010","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1023\/A:1008207228099","article-title":"Adaptive pattern recognition","volume":"7","author":"Johansen","year":"1997","journal-title":"J. Math. Imaging Vision"},{"key":"10.1016\/S0020-0190(01)00275-7_BIB011","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economical suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00275-7_BIB012","series-title":"Proc. 37th IEEE Symp. on Foundations of Computer Science","first-page":"320","article-title":"Efficient approximate and dynamic matching of patterns using a labeling paradigm","author":"Sahinalp","year":"1996"},{"key":"10.1016\/S0020-0190(01)00275-7_BIB013","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","article-title":"On finding lowest common ancestors: Simplification and parallelization","volume":"17","author":"Schieber","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00275-7_BIB014","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","article-title":"On-line construction of suffix trees","volume":"14","author":"Ukkonen","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(01)00275-7_BIB015","series-title":"Proc. 14th IEEE Symposium on Switching and Automata Theory","first-page":"1","article-title":"Linear pattern matching algorithm","author":"Weiner","year":"1973"},{"key":"10.1016\/S0020-0190(01)00275-7_BIB016","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1145\/3828.3839","article-title":"Adding range restriction capability to dynamic data structures","volume":"32","author":"Willard","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00275-7_BIB017","series-title":"New bounds in cell probe model, Ph.D. Thesis","author":"Xiao","year":"1992"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002757?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002757?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T16:23:13Z","timestamp":1556209393000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0020019001002757"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00275-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}