{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:24Z","timestamp":1759638804989},"reference-count":6,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8963,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1989]]},"DOI":"10.1016\/0166-218x(92)90270-k","type":"journal-article","created":{"date-parts":[[2002,12,10]],"date-time":"2002-12-10T21:10:39Z","timestamp":1039554639000},"page":"37-45","source":"Crossref","is-referenced-by-count":36,"title":["Average sizes of suffix trees and DAWGs"],"prefix":"10.1016","volume":"24","author":[{"given":"Anselm","family":"Blumer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Ehrenfeucht","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Haussler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90270-K_BIB1","first-page":"109","author":"Blumer","year":"1984","journal-title":"Building the minimal DFA for the set of all subwords of a word on-line in linear time"},{"key":"10.1016\/0166-218X(92)90270-K_BIB2","series-title":"Proceedings 16th ACM Symposium on Theory of Computing","first-page":"349","article-title":"Building a complete inverted file for a set of text files in linear time","author":"Blumer","year":"1984"},{"key":"10.1016\/0166-218X(92)90270-K_BIB3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","article-title":"The smallest automation recognizing the subwords of a text","volume":"40","author":"Blumer","year":"1985","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0166-218X(92)90270-K_BIB4","first-page":"131","article-title":"The Art of Computer Programming 3: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0166-218X(92)90270-K_BIB5","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1137\/0209061","article-title":"Efficient on-line construction and correction of position trees","author":"Majster","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90270-K_BIB6","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"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290270K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290270K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:55:59Z","timestamp":1555134959000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290270K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":6,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989]]}},"alternative-id":["0166218X9290270K"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90270-k","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1989]]}}}