{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T08:56:06Z","timestamp":1648976166903},"reference-count":15,"publisher":"Elsevier BV","issue":"5-6","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3613,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s1570-8667(03)00037-6","type":"journal-article","created":{"date-parts":[[2003,11,27]],"date-time":"2003-11-27T12:12:55Z","timestamp":1069935175000},"page":"445-460","source":"Crossref","is-referenced-by-count":2,"title":["Two-pattern strings I\u2014A recognition algorithm"],"prefix":"10.1016","volume":"1","author":[{"given":"Frantisek","family":"Franek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weilin","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.F.","family":"Smyth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1570-8667(03)00037-6_BIB001","series-title":"The Design & Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S1570-8667(03)00037-6_BIB002","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0196-6774(84)90026-9","article-title":"A linear algorithm for nonhomogeneous spectra of numbers","volume":"5","author":"Boshernitzan","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S1570-8667(03)00037-6_BIB003","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","article-title":"A fast string searching algorithm","volume":"20\u201310","author":"Boyer","year":"1977","journal-title":"CACM"},{"key":"10.1016\/S1570-8667(03)00037-6_BIB004","series-title":"Proc. 38th Annual IEEE Symp. FOCS","first-page":"137","article-title":"Optimal suffix tree construction with large alphabets","author":"Farach","year":"1997"},{"issue":"1","key":"10.1016\/S1570-8667(03)00037-6_BIB005","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0304-3975(98)00252-7","article-title":"The exact number of squares in Fibonacci words","volume":"218","author":"Fraenkel","year":"1999","journal-title":"TCS"},{"key":"10.1016\/S1570-8667(03)00037-6_BIB006","unstructured":"F. Fran\u011bk, J. Jiang, W.F. Smyth, Two-pattern strings III\u2014frequency of occurrence, submitted for publication"},{"issue":"2","key":"10.1016\/S1570-8667(03)00037-6_BIB007","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0304-3975(00)00063-3","article-title":"Repetitions in Sturmian strings","volume":"249","author":"Fran\u011bk","year":"2000","journal-title":"TCS"},{"key":"10.1016\/S1570-8667(03)00037-6_BIB008","unstructured":"F. Fran\u011bk, W. Lu, W.F. Smyth, Two-pattern strings II\u2014computing all the repetitions, submitted for publication"},{"key":"10.1016\/S1570-8667(03)00037-6_BIB009","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0304-3975(96)00141-7","article-title":"A characterization of the squares in a Fibonacci string","volume":"172","author":"Iliopoulos","year":"1997","journal-title":"TCS"},{"key":"10.1016\/S1570-8667(03)00037-6_BIB010","first-page":"159","article-title":"On maximal repetitions in words","volume":"1","author":"Kolpakov","year":"2000","journal-title":"J. Discrete Algorithms"},{"key":"10.1016\/S1570-8667(03)00037-6_BIB011","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 Trans. Inform. Theory"},{"key":"10.1016\/S1570-8667(03)00037-6_BIB012","series-title":"Algebraic Combinatorics on Words","volume":"90","year":"2002"},{"key":"10.1016\/S1570-8667(03)00037-6_BIB013","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0166-218X(89)90051-6","article-title":"Detecting leftmost maximal periodicities","volume":"25","author":"Main","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S1570-8667(03)00037-6_BIB014","doi-asserted-by":"crossref","first-page":"481","DOI":"10.36045\/bbms\/1103055576","article-title":"Test words for Sturmian morphisms","volume":"6","author":"Richomme","year":"1999","journal-title":"Bull. Belg. Math. Soc."},{"key":"10.1016\/S1570-8667(03)00037-6_BIB015","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 Trans. Inform. Theory"}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000376?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866703000376?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T11:50:12Z","timestamp":1585309812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866703000376"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":15,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S1570866703000376"],"URL":"https:\/\/doi.org\/10.1016\/s1570-8667(03)00037-6","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}