{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:36:41Z","timestamp":1725543401252},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540351573"},{"type":"electronic","value":"9783540351580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11775096_28","type":"book-chapter","created":{"date-parts":[[2006,6,22]],"date-time":"2006-06-22T08:40:18Z","timestamp":1150965618000},"page":"303-313","source":"Crossref","is-referenced-by-count":2,"title":["Computing the \u03bb-Seeds of a String"],"prefix":"10.1007","author":[{"given":"Qing","family":"Guo","sequence":"first","affiliation":[]},{"given":"Hui","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","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. Information Processing Letters\u00a039, 17\u201320 (1991)","journal-title":"Information Processing Letters"},{"key":"28_CR2","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. Theoretical Computer Science\u00a022, 297\u2013315 (1983)","journal-title":"Theoretical Computer Science"},{"key":"28_CR3","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":"28_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0020-0190(94)90060-4","volume":"49","author":"D. Breslauer","year":"1994","unstructured":"Breslauer, D.: Testing string superprimitivity in parallel. Information Processing Letters\u00a049, 235\u2013241 (1994)","journal-title":"Information Processing Letters"},{"key":"28_CR5","unstructured":"Ben-Amram, A.M., Berkman, O., Iliopoulos, C.S., Park, K.: The subtree max gap problem with application to parallel string covering. In: Proc. of 5th ACM-SIAM Symp. on Discrete Algorithmsocessing Letters, Arlington, VA, pp. 501\u2013510 (1994)"},{"key":"28_CR6","unstructured":"Cole, R., Iliopoulos, C.S., Mohamed, M., Smith, W.F., Yang, L.: Computing the minimum k-cover of a string. In: Proc. of the 2003 Prague Stringology Conference (PSC 2003), pp. 51\u201364 (2003)"},{"issue":"5","key":"28_CR7","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. Information Processing Letters\u00a012(5), 244\u2013250 (1981)","journal-title":"Information Processing Letters"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/BF01955677","volume":"16","author":"C.S. Iliopoulos","year":"1996","unstructured":"Iliopoulos, C.S., Moore, D.W.G., Park, K.: Covering a string. Algorithmica\u00a016, 288\u2013297 (1996)","journal-title":"Algorithmica"},{"issue":"8","key":"28_CR9","first-page":"1400","volume":"21","author":"C.S. Iliopoulos","year":"1994","unstructured":"Iliopoulos, C.S., Park, K.: An optimal O(loglogn) time algorithm for parellel superprimitivity testing. J. of the Korean Information Science Society\u00a021(8), 1400\u20131404 (1994)","journal-title":"J. of the Korean Information Science Society"},{"issue":"164","key":"28_CR10","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(96)00047-3","volume":"2","author":"C.S. Iliopoulos","year":"1996","unstructured":"Iliopoulos, C.S., Park, K.: A work-time optimal algorithm for computing all string covers. Theoretical Computer Science\u00a02(164), 299\u2013310 (1996)","journal-title":"Theoretical Computer Science"},{"key":"28_CR11","unstructured":"Iliopoulos, C.S., Smith, W.F.: An on-line algorithm of computing a minimum set of k-covers of a string. In: Proc. of the Ninth Australian Workshop on Combinatorial Algorithms (AWOCA), pp. 97\u2013106 (1998)"},{"issue":"1","key":"28_CR12","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(1), 95\u2013106 (2002)","journal-title":"Algorithmica"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(94)00235-Q","volume":"54","author":"D.W.G. Moore","year":"1995","unstructured":"Moore, D.W.G., Smyth, W.F.: A correction to Computing the covers of a string in linear time. Information Processing Letters\u00a054, 101\u2013103 (1995)","journal-title":"Information Processing Letters"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithms and Complexity","author":"H. Zhang","year":"2006","unstructured":"Zhang, H., Guo, Q., Iliopoulos, C.S.: The \u03bb-cover problem of a string. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998. Springer, Heidelberg (submitted, 2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11775096_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:41Z","timestamp":1619507681000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11775096_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540351573","9783540351580"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11775096_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}