{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:11:47Z","timestamp":1725484307083},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438625"},{"type":"electronic","value":"9783540454526"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45452-7_8","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T21:55:29Z","timestamp":1179266129000},"page":"76-84","source":"Crossref","is-referenced-by-count":0,"title":["Two-Pattern Strings"],"prefix":"10.1007","author":[{"given":"Franti\u0161ek","family":"Fran\u011bk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiandong","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weilin","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William F.","family":"Smyth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0196-6774(84)90026-9","volume":"5","author":"M. Boshernitzan","year":"1984","unstructured":"M. Boshernitzan & Aviezri S. Fraenkel, A linear algorithm for nonhomogeneous spectra of numbers, J. Algorithms 5 (1984) 187\u2013198.","journal-title":"J. Algorithms"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12-5","author":"M. Crochemore","year":"1981","unstructured":"Maxime Crochemore, An optimal algorithm for computing the repetitions in a word, IPL 12-5 (1981) 244\u2013250.","journal-title":"IPL"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Martin Farach, Optimal suffix tree construction with large alphabets, Proc. 38th Annual IEEE Symp. FOCS (1997) 137\u2013143.","DOI":"10.1109\/SFCS.1997.646102"},{"key":"8_CR4","first-page":"83","volume":"218-1","author":"A. S. Fraenkel","year":"1999","unstructured":"Aviezri S. Fraenkel & R. Jamie Simpson, The exact number of squares in Fibonacci words, TCS 218-1 (1999) 83\u201394.","journal-title":"TCS"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(00)00063-3","volume":"249-2","author":"F. Fran\u011bk","year":"2000","unstructured":"Franti\u0161ek Fran\u011bk, Ay\u015fe Karaman & W. F. Smyth, Repetitions in Sturmian strings, TCS 249-2 (2000) 289\u2013303.","journal-title":"TCS"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0097-3165(81)90038-8","volume":"A 30","author":"L. J. Guibas","year":"1981","unstructured":"Leo J. Guibas & Andrew M. Odlyzko, Periods in strings, J. Combinatorial Theory, Series A 30 (1981) 19\u201342.","journal-title":"J. Combinatorial Theory, Series"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0304-3975(96)00141-7","volume":"172","author":"C. S. Iliopoulos","year":"1997","unstructured":"Costas S. Iliopoulos, Dennis Moore & W. F. Smyth, A characterization of the squares in a Fibonacci string, TCS 172 (1997) 281\u2013291.","journal-title":"TCS"},{"key":"8_CR8","first-page":"159","volume":"1","author":"R. Kolpakov","year":"2000","unstructured":"Roman Kolpakov & Gregory Kucherov, On maximal repetitions in words, J. Discrete Algorithms 1 (2000) 159\u2013186.","journal-title":"J. Discrete Algorithms"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"A. Lempel","year":"1976","unstructured":"Abraham Lempel & Jacob Ziv, On the complexity of finite sequences, IEEE Trans. Information Theory 22 (1976) 75\u201381.","journal-title":"IEEE Trans. Information Theory"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0166-218X(89)90051-6","volume":"25","author":"M. G. Main","year":"1989","unstructured":"Michael G. Main, Detecting leftmost maximal periodicities, Discrete Applied Maths. 25 (1989) 145\u2013153.","journal-title":"Discrete Applied Maths"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Jacob Ziv & Abraham Lempel, A universal algorithm for sequential data compression, IEEE Trans. Information Theory 23 (1977) 337\u2013343.","journal-title":"IEEE Trans. Information Theory"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45452-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T12:56:06Z","timestamp":1550321766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45452-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438625","9783540454526"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45452-7_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}