{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:08:23Z","timestamp":1725566903968},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262015"},{"type":"electronic","value":"9783540315629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496656_22","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T19:17:26Z","timestamp":1285442246000},"page":"257-265","source":"Crossref","is-referenced-by-count":2,"title":["A New Periodicity Lemma"],"prefix":"10.1007","author":[{"given":"Kangmin","family":"Fan","sequence":"first","affiliation":[]},{"given":"William F.","family":"Smyth","sequence":"additional","affiliation":[]},{"given":"R. J.","family":"Simpson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","volume":"22","author":"A. Apostolico","year":"1983","unstructured":"Apostolico, A., Preparata, F.P.: Optimal off-line detection of repetitions in a string. Theoret. Comput. Sci.\u00a022, 297\u2013315 (1983)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"22_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M. Crochemore","year":"1981","unstructured":"Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Inform. Process. Lett.\u00a012(5), 244\u2013250 (1981)","journal-title":"Inform. Process. Lett."},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: Proc. 38th IEEE Symp. Found. Computer Science, pp. 137\u2013143 (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"N.J. Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc.\u00a016, 109\u2013114 (1965)","journal-title":"Proc. Amer. Math. Soc."},{"key":"22_CR5","unstructured":"Franek, F., Simpson, R.J., Smyth, W.F.: The maximum number of runs in a string. In: Miller, M., Park, K. (eds.) Proc. 14th Australasian Workshop on Combinatorial Algorithms, pp. 26\u201335 (2003)"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1007\/3-540-45061-0_73","volume-title":"Automata, Languages and Programming","author":"J. K\u00e4rkk\u00e4inen","year":"2003","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P.: Simple linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 943\u2013955. Springer, Heidelberg (2003)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-44888-8_15","volume-title":"Combinatorial Pattern Matching","author":"P. Ko","year":"2003","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 200\u2013210. Springer, Heidelberg (2003)"},{"key":"22_CR8","first-page":"159","volume":"1","author":"R. Kolpakov","year":"2000","unstructured":"Kolpakov, R., Kucherov, G.: On maximal repetitions in words. J. Discrete Algs.\u00a01, 159\u2013186 (2000)","journal-title":"J. Discrete Algs."},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"A. Lempel","year":"1976","unstructured":"Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE Trans. Information Theory\u00a022, 75\u201381 (1976)","journal-title":"IEEE Trans. Information Theory"},{"key":"22_CR10","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words, p. 504. Cambridge University Press, Cambridge (2002)"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0166-218X(89)90051-6","volume":"25","author":"M.G. Main","year":"1989","unstructured":"Main, M.G.: Detecting leftmost maximal periodicities. Discrete Applied Maths.\u00a025, 145\u2013153 (1989)","journal-title":"Discrete Applied Maths."},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","volume":"5","author":"M.G. Main","year":"1984","unstructured":"Main, M.G., Lorentz, R.J.: An O(n log n) algorithm for finding all repetitions in a string. J. Algs.\u00a05, 422\u2013432 (1984)","journal-title":"J. Algs."},{"issue":"2","key":"22_CR13","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"32","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. Assoc. Comput. Mach.\u00a032(2), 262\u2013272 (1976)","journal-title":"J. Assoc. Comput. Mach."},{"key":"22_CR14","first-page":"423","volume-title":"Computing Patterns in Strings","author":"B. Smyth","year":"2003","unstructured":"Smyth, B.: Computing Patterns in Strings, p. 423. Pearson Addison-Wesley, London (2003)"},{"key":"22_CR15","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiana\u00a07, 1\u201322 (1906)","journal-title":"Skr. I. Mat. Nat. Kl. Christiana"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proc. 14th Annual IEEE Symp. Switching & Automata Theory, pp.\u00a01\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496656_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:11Z","timestamp":1619505611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496656_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262015","9783540315629"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11496656_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}