{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:41Z","timestamp":1742617181918,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580942"},{"type":"electronic","value":"9783540484509"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58094-8_13","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:11:42Z","timestamp":1330269102000},"page":"146-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Computation of squares in a string"],"prefix":"10.1007","author":[{"given":"S. Rao","family":"Kosaraju","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"A. Apostolico and F. P. Preparata. Optimal off-line detection of repetitions in a string, Theoretical Computer Science, pages 297\u2013315, 1983.","DOI":"10.1016\/0304-3975(83)90109-3"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"W. L. Chang and E. L. Lawler. Approximate string matching in sublinear expected time. Proc. of 31st IEEE FOCS, pages 116\u2013124, 1990.","DOI":"10.1109\/FSCS.1990.89530"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"M. T. Chen and J. Seiferas. Efficient and elegant subword tree construction. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, pages 97\u2013107. Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-82456-2_7"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M. Crochemore","year":"1981","unstructured":"M. Crochemore. An optimal algorithm for computing the repetitions in a word, Inf. Processing Letters 12, pages 244\u2013250, 1981.","journal-title":"Inf. Processing Letters"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"M. Crochemore. Transducers and repetitions, Theoretical Computer Science, pages 63\u201386, 1986.","DOI":"10.1016\/0304-3975(86)90041-1"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"M. G. Main and R. J. Lorentz. An O(n log n) algorithm for finding all repetitions in a string, J. of Algorithms, pages 422\u2013432, 1984.","DOI":"10.1016\/0196-6774(84)90021-X"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"M. G. Main and R. L. Lorentz. Linear time recognition of squarefree strings. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, pages 271\u2013278, Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-82456-2_18"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"E. M. McCreight. A space-economical suffix tree construction algorithm. J. of ACM, pages 262\u2013272, 1976.","DOI":"10.1145\/321941.321946"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"M. O. Rabin. Discovering repetitions in strings. In A. Apostolico and Z. Galil. editors, Combinatorial Algorithms on Words, pages 279\u2013288. Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-82456-2_19"},{"key":"13_CR10","unstructured":"J. Seiferas. Subword trees, Class Notes, February 1977."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"A. O. Slisenko. Detection of periodicities and string-matching in real time. J. of Soviet Mathematics, pages 1316\u20131386. 1983.","DOI":"10.1007\/BF01084395"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"P. Weiner. Linear pattern matching algorithms. Proc. of 14th IEEE Symp. on Switching & Automata Theory, pages 1\u201311, 1973.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58094-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:19:06Z","timestamp":1742595546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58094-8_13"}},"subtitle":["Preliminary version"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580942","9783540484509"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-58094-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}