{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T13:12:33Z","timestamp":1770556353011,"version":"3.49.0"},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"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":[[1991,7]]},"DOI":"10.1016\/0020-0190(91)90056-n","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"17-20","source":"Crossref","is-referenced-by-count":76,"title":["Optimal superprimitivity testing for strings"],"prefix":"10.1016","volume":"39","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[]},{"given":"Martin","family":"Farach","sequence":"additional","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90056-N_BIB1","article-title":"Efficient detection of quasiperiodicities in strings","author":"Apostolico","year":"1990","journal-title":"Fibonacci Report 90.6"},{"key":"10.1016\/0020-0190(91)90056-N_BIB2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","article-title":"Optimal off-line detection of repetitions in a string","volume":"22","author":"Apostolico","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(91)90056-N_BIB3","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/0020-0190(91)90056-N_BIB4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1307\/mmj\/1028998766","article-title":"The equation aM = bNcP in a free group","volume":"9","author":"Lyndon","year":"1962","journal-title":"Michigan Math. J."},{"issue":"2","key":"10.1016\/0020-0190(91)90056-N_BIB5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190056N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190056N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:24:49Z","timestamp":1555143889000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190056N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["002001909190056N"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90056-n","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}