{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T06:08:45Z","timestamp":1700633325087},"reference-count":31,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0196-6774(92)90049-i","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"446-467","source":"Crossref","is-referenced-by-count":35,"title":["Self-alignments in words and their applications"],"prefix":"10.1016","volume":"13","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(92)90049-I_BIB1","series-title":"Combinatorial Algorithms on Words","first-page":"85","article-title":"The myriad virtues of suffix trees","author":"Apostolico","year":"1985"},{"key":"10.1016\/0196-6774(92)90049-I_BIB2","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1109\/TIT.1987.1057284","article-title":"Robust transmission of unbounded strings using Fibonacci representations","author":"Apostolico","year":"1987","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0196-6774(92)90049-I_BIB3","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0196-6774(92)90049-I_BIB4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(83)90109-3","article-title":"Optimal off-line detection of repetitions in string","volume":"22","author":"Apostolico","year":"1983","journal-title":"Theoret. Comput. Sci."},{"issue":"No. 2","key":"10.1016\/0196-6774(92)90049-I_BIB5","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/0022-0000(85)90060-1","article-title":"Structural properties of the string statistics problem","volume":"31","author":"Apostolico","year":"1985","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0196-6774(92)90049-I_BIB6","article-title":"Data Structures and Algorithms for the String Statistics Problem","author":"Apostolico","year":"1985","journal-title":"Purdue CS D-TR-547"},{"issue":"No. 5","key":"10.1016\/0196-6774(92)90049-I_BIB7","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","article-title":"An optimal algorithm for computing the repetitions in a word","volume":"12","author":"Crochemore","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(92)90049-I_BIB8","first-page":"781","article-title":"Recherche lineaire d'un carre dans un mot","volume":"296","author":"Crochemore","year":"1983","journal-title":"C. R. Acad. Sci. Paris Ser. I"},{"key":"10.1016\/0196-6774(92)90049-I_BIB9","doi-asserted-by":"crossref","DOI":"10.1137\/0221005","article-title":"A Note of the Height of Suffix Trees","volume":"21","author":"Devroye","year":"1992","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0196-6774(92)90049-I_BIB10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/359460.359480","article-title":"Economical encoding of commas between strings","volume":"21","author":"Even","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/0196-6774(92)90049-I_BIB11","series-title":"An Introduction to Probability Theory and its Applications","author":"Feller","year":"1968"},{"key":"10.1016\/0196-6774(92)90049-I_BIB12","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\/0196-6774(92)90049-I_BIB13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0097-3165(81)90005-4","article-title":"String overlaps, pattern matching, and nontransitive games","volume":"30","author":"Guibas","year":"1981","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0196-6774(92)90049-I_BIB14","article-title":"Autocorrelation on Words and Its Applications. Analysis of Suffix Tree by String-Ruler Approach","author":"Jacquet","year":"1989","journal-title":"INRIA TR-1106"},{"key":"10.1016\/0196-6774(92)90049-I_BIB15","series-title":"The Art of Computer Programming, Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0196-6774(92)90049-I_BIB16","series-title":"Combinatorics on Words","author":"Lothaire","year":"1982"},{"key":"10.1016\/0196-6774(92)90049-I_BIB17","first-page":"286","article-title":"Maximally dependent random variables","volume":"73","author":"Lai","year":"1976"},{"key":"10.1016\/0196-6774(92)90049-I_BIB18","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF00536046","article-title":"A class of dependent random variables and their maxima","volume":"42","author":"Lai","year":"1978","journal-title":"Z. Wahrsch."},{"issue":"No. 1","key":"10.1016\/0196-6774(92)90049-I_BIB19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","article-title":"On the complexity of finite sequences","volume":"22","author":"Lempel","year":"1976","journal-title":"IEEE Inform. Theory"},{"key":"10.1016\/0196-6774(92)90049-I_BIB20","series-title":"Analytic Inequalities","author":"Mitrinovi\u0107","year":"1970"},{"key":"10.1016\/0196-6774(92)90049-I_BIB21","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. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(92)90049-I_BIB22","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","article-title":"An O(n log n) algorithm for finding all repetitions in a string","author":"Main","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(92)90049-I_BIB23","series-title":"Combinatorial Algorithms on Words","article-title":"Linear time recognition of square-free strings","author":"Main","year":"1984"},{"key":"10.1016\/0196-6774(92)90049-I_BIB24","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. Probab."},{"key":"10.1016\/0196-6774(92)90049-I_BIB25","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/322234.322237","article-title":"Linear algorithm for data compression via string matching","volume":"28","author":"Rodeh","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(92)90049-I_BIB26","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0196-6774(88)90039-9","article-title":"Some results on V-ary asymmetric tries","volume":"9","author":"Szpankowski","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(92)90049-I_BIB27","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/BF01759045","article-title":"On the height of digital trees and related topics","volume":"6","author":"Szpankowski","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/0196-6774(92)90049-I_BIB28","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1145\/96559.214080","article-title":"Patricia tries again revisited","volume":"37","author":"Szpankowski","year":"1990","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(92)90049-I_BIB29","first-page":"7","article-title":"Uber die gegenseitige Lage gleicher Teibe gewisser zeichenreichen","volume":"1","author":"Thue","year":"1912","journal-title":"Skr. Vid. Kristiana 1, Math Naturv. Klasse"},{"key":"10.1016\/0196-6774(92)90049-I_BIB30","series-title":"Proceedings, 14th Annual Symposium on Switching and Automata Theory","first-page":"1","article-title":"Linear pattern matching algorithms","author":"Weiner","year":"1973"},{"issue":"No. 3","key":"10.1016\/0196-6774(92)90049-I_BIB31","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 Inform. Theory"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749290049I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749290049I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:53:15Z","timestamp":1548744795000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749290049I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["019667749290049I"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(92)90049-i","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}