{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T04:25:35Z","timestamp":1649046335787},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"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,8]]},"DOI":"10.1016\/s0020-0190(01)00327-1","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"159-161","source":"Crossref","is-referenced-by-count":3,"title":["A speed-up for the commute between subword trees and DAWGs"],"prefix":"10.1016","volume":"83","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Lonardi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00327-1_BIB001","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0020-0190(01)00327-1_BIB002","series-title":"Pattern Matching Algorithms","year":"1997"},{"issue":"3","key":"10.1016\/S0020-0190(01)00327-1_BIB003","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1145\/28869.28873","article-title":"Complete inverted files for efficient text retrieval and analysis","volume":"34","author":"Blumer","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(01)00327-1_BIB004","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","article-title":"The smallest automaton recognizing the subwords of a text","volume":"40","author":"Blumer","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(01)00327-1_BIB005","series-title":"Text Algorithms","author":"Crochemore","year":"1994"},{"key":"10.1016\/S0020-0190(01)00327-1_BIB006","series-title":"Complexity of Computer Computations","first-page":"131","article-title":"Isomorphism of planar graphs","author":"Hopcroft","year":"1972"},{"key":"10.1016\/S0020-0190(01)00327-1_BIB007","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)00327-1_BIB008","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF01206331","article-title":"On-line constructin of suffix trees","volume":"14","author":"Ukkonen","year":"1995","journal-title":"Algorithmica"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003271?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003271?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T03:57:34Z","timestamp":1556855854000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001003271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0020019001003271"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00327-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}