{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:11:19Z","timestamp":1725808279440},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319125671"},{"type":"electronic","value":"9783319125688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44722-2_12","type":"book-chapter","created":{"date-parts":[[2014,9,15]],"date-time":"2014-09-15T01:23:09Z","timestamp":1410744189000},"page":"106-115","source":"Crossref","is-referenced-by-count":0,"title":["On-line Minimum Closed Covers"],"prefix":"10.1007","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[]},{"given":"Manal","family":"Mohamed","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-45022-X_8","volume-title":"Automata, Languages and Programming","author":"S. Alstrup","year":"2000","unstructured":"Alstrup, S., Holm, J.: Improved Algorithms for Finding Level Ancestors in Dynamic Trees. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 73\u201384. Springer, Heidelberg (2000)"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(91)90056-N","volume":"39","author":"A. Apostolico","year":"1991","unstructured":"Apostolico, A., Farach, M., Iliopoulos, C.S.: Optimal Superprimitivity Testing for Strings. Inform. Processing Letter\u00a039, 17\u201320 (1991)","journal-title":"Inform. Processing Letter"},{"key":"12_CR3","unstructured":"Badkobeh, G., Bannai, H., Goto, K.: I, Tomohiro, Iliopoulos, C. S., Inenaga, S., Puglisi, S.J., Sugimoto, S.: Closed Factorization (to appear)"},{"key":"12_CR4","unstructured":"Badkobeh, G., Fici, G., Lipt\u00e1k, Z.: A Note on Words With the Smallest Number of Closed Factors. CoRR abs\/1305.6395 (2013)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90111-8","volume":"44","author":"D. Breslauer","year":"1992","unstructured":"Breslauer, D.: An On-Line String Superprimitivity Test. Information Processing Letters\u00a044, 345\u2013347 (1992)","journal-title":"Information Processing Letters"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-02737-6_11","volume-title":"Developments in Language Theory","author":"M. Bucci","year":"2009","unstructured":"Bucci, M., de Luca, A., De Luca, A.: Rich and Periodic-Like Words. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 145\u2013155. Springer, Heidelberg (2009)"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/PL00013314","volume":"37","author":"A. Carpi","year":"2001","unstructured":"Carpi, A., de Luca, A.: Periodic-Like Words, Periodicity and Boxes. Acta Informatica\u00a037, 597\u2013618 (2001)","journal-title":"Acta Informatica"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ipl.2007.10.006","volume":"106","author":"M. Crochemore","year":"2008","unstructured":"Crochemore, M., Ilie, L.: Computing Longest Previous Factor in Linear Time and Applications. Inf. Process. Lett.\u00a0106(2), 75\u201380 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejc.2012.07.011","volume":"34","author":"M. Crochemore","year":"2013","unstructured":"Crochemore, M., Ilie, L., Iliopoulos, C.S., Kubica, M., Rytter, W., Walen, T.: Computing the Longest Previous Factor. Eur. J. Comb.\u00a034(1), 15\u201326 (2013)","journal-title":"Eur. J. Comb."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Fici, G.: A Classification of Trapezoidal Words. In: Ambroz, P., Holub, S., Masakova, Z. (eds.) 8th International Conference on Words, WORDS 2011. Electronic Proceedings in Theoretical Computer Science, vol.\u00a063, pp. 129\u2013137 (2011)","DOI":"10.4204\/EPTCS.63.18"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.ejc.2008.04.006","volume":"30","author":"A. Glen","year":"2009","unstructured":"Glen, A., Justin, J., Widmer, S., Zamboni, L.Q.: Palindromic Richness. European J. Combin.\u00a030, 510\u2013531 (2009)","journal-title":"European J. Combin."},{"issue":"19","key":"12_CR12","doi-asserted-by":"publisher","first-page":"3957","DOI":"10.1016\/j.ins.2007.02.020","volume":"177","author":"Q. Guo","year":"2007","unstructured":"Guo, Q., Zhang, H., Iliopoulos, C.S.: Computing the \u03bb-Covers of a String. Inf. Sci.\u00a0177(19), 3957\u20133967 (2007)","journal-title":"Inf. Sci."},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"2571","DOI":"10.1016\/j.ins.2011.02.009","volume":"181","author":"C.S. Iliopoulos","year":"2011","unstructured":"Iliopoulos, C.S., Mohamed, M., Smyth, W.F.: New Complexity Results for the k-Covers Problem. International Journal of Information Sciences\u00a0181, 2571\u20132575 (2011)","journal-title":"International Journal of Information Sciences"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(93)90159-Q","volume":"119","author":"C.S. Iliopoulos","year":"1993","unstructured":"Iliopoulos, C.S., Mouchard, L.: An O(nlogn) Algorithm for Computing All Maximal Quasiperiodicities in Strings. Theoratical Computer Science\u00a0119, 247\u2013265 (1993)","journal-title":"Theoratical Computer Science"},{"key":"12_CR15","unstructured":"Iliopoulos, C.S., Smyth, W.F.: On-Line Algorithms for k-Covering. In: Proc. Ninth Australasian Workshop on Combinatorial Algorithms, pp. 107\u2013116 (1998)"},{"key":"12_CR16","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.: Simpler 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":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-44888-8_14","volume-title":"Combinatorial Pattern Matching","author":"D.-K. Kim","year":"2003","unstructured":"Kim, D.-K., Sim, J.S., Park, H.-J., Park, K.: Linear-Time Construction of Suffix Arrays. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 186\u2013199. Springer, Heidelberg (2003)"},{"issue":"24","key":"12_CR18","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.jda.2004.08.002","volume":"3","author":"P. Ko","year":"2005","unstructured":"Ko, P., Aluru, S.: Space Efficient Linear Time Construction of Suffix Arrays. Journal of Discrete Algorithms\u00a03(24), 143\u2013156 (2005)","journal-title":"Journal of Discrete Algorithms"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00453-001-0062-2","volume":"32","author":"Y. Li","year":"2002","unstructured":"Li, Y., Smyth, W.F.: Computing the Cover Array in Linear Time. Algorithmica\u00a032, 95\u2013106 (2002)","journal-title":"Algorithmica"},{"key":"12_CR20","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(nlogn) Algorithm for Finding All Repetitions in a String. J. Algs.\u00a05, 422\u2013432 (1984)","journal-title":"J. Algs."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Manber, U., Myers, G.: Suffix Arrays: A New Method for On-Line Search. SIAM J. on Computing, 935\u2013948 (1993)","DOI":"10.1137\/0222058"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0020-0190(94)00045-X","volume":"50","author":"D. Moore","year":"1994","unstructured":"Moore, D., Smyth, W.F.: An Optimal Algorithm to Compute All the Covers of a String. Information Processing Letters\u00a050, 239\u2013246 (1994)","journal-title":"Information Processing Letters"},{"key":"12_CR23","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":"Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-319-07566-2_16","volume-title":"Combinatorial Pattern Matching","author":"I. Tomohiro","year":"2014","unstructured":"Tomohiro, I., Sugimoto, S., Inenaga, S., Bannai, H., Takeda, M.: Computing palindromic factorizations and palindromic covers on-line. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol.\u00a08486, pp. 150\u2013161. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44722-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T22:05:39Z","timestamp":1558994739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44722-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44722-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}