{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:28:58Z","timestamp":1725470938108},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540457749"},{"type":"electronic","value":"9783540457756"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11880561_5","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T08:16:48Z","timestamp":1159431408000},"page":"49-60","source":"Crossref","is-referenced-by-count":0,"title":["Computing the Minimum Approximate \u03bb-Cover 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":"5_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":"5_CR2","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 online string superprimitivity test. Information Processing Letters\u00a044, 345\u2013347 (1992)","journal-title":"Information Processing Letters"},{"key":"5_CR3","unstructured":"Christodoulakis, M., Iliopoulos, C.S., Park, K., Sim, J.S.: Approximate seeds of strings. In: Proc. of the 2003 Prague Stringology Conference (PSC 2003), pp. 25\u201336 (2003)"},{"issue":"5","key":"5_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.: An Optimal Algorithm for Computing the Repetitions in a Word. Information Processing Letters\u00a012(5), 244\u2013250 (1981)","journal-title":"Information Processing Letters"},{"issue":"8","key":"5_CR5","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"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-45123-4_7","volume-title":"Combinatorial Pattern Matching","author":"S.-R. Kim","year":"2000","unstructured":"Kim, S.-R., Park, K.: A dynamic edit distance table. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 60\u201368. Springer, Heidelberg (2000)"},{"issue":"1","key":"5_CR7","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":"5_CR8","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":"5_CR9","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/S0304-3975(00)00365-0","volume":"262","author":"J.S. Sim","year":"2001","unstructured":"Sim, J.S., Iliopoulos, C.S., Park, K., Smyth, W.F.: Approximate periods of strings. Theoretical Computer Science\u00a0262, 557\u2013568 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"5_CR10","first-page":"16","volume":"29","author":"J.S. Sim","year":"2002","unstructured":"Sim, J.S., Park, K., Kim, S., Lee, J.: Finding approximate covers of strings. Journal of Korea Information Science Society\u00a029(1), 16\u201321 (2002)","journal-title":"Journal of Korea Information Science Society"},{"key":"5_CR11","unstructured":"Zhang, H., Guo, Q., Iliopoulos, C.S.: Computing the \u03bb-covers of a string. In: AWOCA (accepted, 2006)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11880561_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:27:23Z","timestamp":1619494043000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11880561_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540457749","9783540457756"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11880561_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}