{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:42:07Z","timestamp":1649040127876},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"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":7533,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1016\/0304-3975(92)90262-e","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"395-400","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic modeling of data structures on words"],"prefix":"10.1016","volume":"106","author":[{"given":"Peter","family":"Kirschenhofer","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Prodinger","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90262-E_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(92)90262-E_BIB2","series-title":"Combinatorial Algorithms on Words","first-page":"85","article-title":"The myriad virtues of suffix trees","author":"Apostolico","year":"1985"},{"key":"10.1016\/0304-3975(92)90262-E_BIB3","first-page":"116","article-title":"Approximate string matching in sublinear expected time","author":"Chang","year":"1990","journal-title":"Proc. 1990 FOCS"},{"key":"10.1016\/0304-3975(92)90262-E_BIB4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00264279","article-title":"On the performance evaluation of extendible hashing and trie searching","volume":"20","author":"Flajolet","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(92)90262-E_BIB5","doi-asserted-by":"crossref","DOI":"10.1002\/rsa.3240030309","article-title":"Generalized digital trees and their difference\u2013differential equations","volume":"3","author":"Flajolet","year":"1992","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/0304-3975(92)90262-E_BIB6","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1137\/0215054","article-title":"Digital search trees revisited","volume":"15","author":"Flajolet","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90262-E_BIB7","series-title":"Handbook of Algorithms and Data Structures","author":"Gonnet","year":"1991"},{"key":"10.1016\/0304-3975(92)90262-E_BIB8","article-title":"Normal limiting distribution for the size and external path length of tries","author":"Jacquet","year":"1988","journal-title":"INRIA TR-827"},{"key":"10.1016\/0304-3975(92)90262-E_BIB9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(88)90023-0","article-title":"Further results on digital search trees","volume":"58","author":"Kirschenhofer","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90262-E_BIB10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0166-218X(89)90050-4","article-title":"On the variance of the external path length in a symmetric digital trie","volume":"25","author":"Kirschenhofer","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(92)90262-E_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(89)90115-1","article-title":"On the balance property of Patricia tries: External path length viewpoint","volume":"68","author":"Kirschenhofer","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90262-E_BIB12","volume":"Vol. I","author":"Knuth","year":"1967"},{"key":"10.1016\/0304-3975(92)90262-E_BIB13","volume":"Vol. III","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(92)90262-E_BIB14","series-title":"Evolution of Random Search Trees","author":"Mahmoud","year":"1992"},{"key":"10.1016\/0304-3975(92)90262-E_BIB15","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1214\/aop\/1176993000","article-title":"Asymptotic growth of a class of random trees","volume":"18","author":"Pittel","year":"1985","journal-title":"Ann. Probability"},{"key":"10.1016\/0304-3975(92)90262-E_BIB16","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1214\/aop\/1176989934","article-title":"Entropy and prefixes","volume":"20","author":"Shields","year":"1992","journal-title":"Ann. Probability"},{"key":"10.1016\/0304-3975(92)90262-E_BIB17","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1145\/96559.214080","article-title":"Patricia tries again revisited","volume":"37","author":"Szpankowski","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90262-E_BIB18","doi-asserted-by":"crossref","unstructured":"W. Szpankowski, Asymptotic properties of data compression and suffix trees, IEEE Trans. Inform. Theory, submitted.","DOI":"10.1109\/18.259648"},{"key":"10.1016\/0304-3975(92)90262-E_BIB19","doi-asserted-by":"crossref","unstructured":"W. Szpankowski, A generalized suffix tree and its (un)expected asymptotic behaviors, SIAM J. Comput., to appear.","DOI":"10.1137\/0222070"},{"key":"10.1016\/0304-3975(92)90262-E_BIB20","series-title":"Mathematical Methods for DNA Sequences","author":"Waterman","year":"1991"},{"key":"10.1016\/0304-3975(92)90262-E_BIB21","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1109\/18.45281","article-title":"Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression","volume":"35","author":"Wyner","year":"1989","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290262E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290262E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:21:00Z","timestamp":1555129260000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290262E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["030439759290262E"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90262-e","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}