{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:32:59Z","timestamp":1725557579103},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135088"},{"type":"electronic","value":"9783642135095"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13509-5_6","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T09:19:57Z","timestamp":1277198397000},"page":"51-62","source":"Crossref","is-referenced-by-count":5,"title":["A Minimal Periods Algorithm with Applications"],"prefix":"10.1007","author":[{"given":"Zhi","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_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":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/BF02574705","volume":"6","author":"D. Beauquier","year":"1991","unstructured":"Beauquier, D., Nivat, M.: On translating one polyomino to tile the plane. Discrete Comput. Geom.\u00a06(1), 575\u2013592 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"6_CR3","unstructured":"Chiniforooshan, E., Kari, L., Xu, Z.: Pseudo-power avoidance. CoRR abs\/0911. 2233 (2009), \n                  \n                    http:\/\/arxiv.org\/abs\/0911.2233"},{"issue":"5","key":"6_CR4","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.: Optimal algorithm for computing the repetitions in a word. Info. Proc. Lett.\u00a012(5), 244\u2013250 (1981)","journal-title":"Info. Proc. Lett."},{"key":"6_CR5","first-page":"781","volume":"296","author":"M. Crochemore","year":"1983","unstructured":"Crochemore, M.: Recherche lin\u00e9aire d\u2019un carr\u00e9 dans un mot. Comptes Rendus Acad. Sci. Paris S\u00e9r.\u00a0I 296, 781\u2013784 (1983)","journal-title":"Comptes Rendus Acad. Sci. Paris S\u00e9r."},{"issue":"50","key":"6_CR6","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1016\/j.tcs.2009.08.024","volume":"410","author":"M. Crochemore","year":"2009","unstructured":"Crochemore, M., Ilie, L., Rytter, W.: Repetitions in strings: Algorithms and combinatorics. Theoret. Comput. Sci.\u00a0410(50), 5227\u20135235 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.tcs.2004.06.024","volume":"326","author":"J. Duval","year":"2004","unstructured":"Duval, J., Kolpakov, R., Kucherov, G., Lecroq, T., Lefebvre, A.: Linear-time computation of local periods. Theoret. Comput. Sci.\u00a0326, 229\u2013240 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"A.S. Fraenkel","year":"1998","unstructured":"Fraenkel, A.S., Simpson, J.: How many squares can a string contain? J. Combin. Theory Ser. A\u00a082(1), 112\u2013120 (1998)","journal-title":"Combin. Theory Ser. A"},{"key":"6_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)"},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.jcss.2004.03.004","volume":"69","author":"D. Gusfield","year":"2004","unstructured":"Gusfield, D., Stoye, J.: Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci.\u00a069(4), 525\u2013546 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput.\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.tcs.2007.03.025","volume":"380","author":"L. Ilie","year":"2007","unstructured":"Ilie, L.: A note on the number of squares in a word. Theoret. Comput. Sci.\u00a0380(3), 373\u2013376 (2007)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"6_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. Knuth","year":"1977","unstructured":"Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM J. Comput.\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"6_CR14","first-page":"596","volume-title":"Proc. 40th Ann. Symp. Found. Comput. Sci. (FOCS 1999)","author":"R. Kolpakov","year":"1999","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proc. 40th Ann. Symp. Found. Comput. Sci (FOCS 1999), pp. 596\u2013604. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/3-540-58094-8_13","volume-title":"Proc. 5th Combinat. Patt. Matching","author":"S.R. Kosaraju","year":"1994","unstructured":"Kosaraju, S.R.: Computation of squares in a string. In: Crochemore, M., Gusfield, D. (eds.) Proc. 5th Combinat. Patt. Matching, pp. 146\u2013150. Springer, Heidelberg (1994)"},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","volume":"5","author":"M. Main","year":"1984","unstructured":"Main, M., Lorentz, R.: An O(nlogn) algorithm for finding all repetitions in a string. J. Algorithms\u00a05(3), 422\u2013432 (1984)","journal-title":"J. Algorithms"},{"key":"6_CR17","first-page":"272","volume-title":"Combinat. Algor. on Words","author":"M. Main","year":"1985","unstructured":"Main, M., Lorentz, R.: Linear time recognition of square free strings. In: Apostolico, A., Galil, Z. (eds.) Combinat. Algor. on Words, pp. 272\u2013278. Springer, Heidelberg (1985)"},{"issue":"1\u20132","key":"6_CR18","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 Appl. Math.\u00a025(1\u20132), 145\u2013153 (1989)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"6_CR19","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. J. Assoc. Comput. Mach.\u00a023(2), 262\u2013272 (1976)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"6","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: Simplification and parallelization. SIAM J. Comput.\u00a017(6), 1253\u20131262 (1988)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"6_CR21","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1007\/BF01084395","volume":"22","author":"A.O. Slisenko","year":"1983","unstructured":"Slisenko, A.O.: Detection of periodicities and string-matching in real time. J. Math. Sci (N. Y.)\u00a022(3), 1316\u20131387 (1983)","journal-title":"J. Math. Sci. (N. Y.)"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0030787","volume-title":"Proc. 9th Combinat. Patt. Matching","author":"J. Stoye","year":"1998","unstructured":"Stoye, J., Gusfield, D.: Simple and flexible detection of contiguous repeats using a suffix tree preliminary version. In: Farach-Colton, M. (ed.) Proc. 9th Combinat. Patt. Matching, pp. 140\u2013152. Springer, Heidelberg (1998)"},{"key":"6_CR23","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I. Mat.-Nat. Kl\u00a0(7), 1\u201322 (1906)"},{"key":"6_CR24","unstructured":"Ukkonen, E.: Constructing suffix trees on-line in linear time. In: Leeuwen, J.V. (ed.) Proc. Infor. Proces. 92, IFIP Trans. A-12., Vol. 1. pp. 484\u2013492. Elsevier, Amsterdam (1992)"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proc. 14th IEEE Ann. Symp. on Switching and Automata Theory (SWAT), pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"key":"6_CR26","unstructured":"Xu, Z.: \n                  \n                    http:\/\/www.csd.uwo.ca\/~zhi_xu\/demons\/cpm2010xu.html\n                  \n                  \n                 (2010)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13509-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:06:00Z","timestamp":1619784360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13509-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135088","9783642135095"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13509-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}