{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:00:52Z","timestamp":1726408852647},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075655"},{"type":"electronic","value":"9783319075662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07566-2_20","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T23:50:31Z","timestamp":1402530631000},"page":"192-201","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Algorithms for Shortest Partial Seeds in Words"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Kociumaka","sequence":"first","affiliation":[]},{"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[]},{"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Wale\u0144","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0304-3975(93)90159-Q","volume":"119","author":"A. Apostolico","year":"1993","unstructured":"Apostolico, A., Ehrenfeucht, A.: Efficient detection of quasiperiodicities in strings. Theor. Comput. Sci.\u00a0119(2), 247\u2013265 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"20_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. Inf. Process. Lett.\u00a039(1), 17\u201320 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"20_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. Inf. Process. Lett.\u00a044(6), 345\u2013347 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"5\/6","key":"20_CR4","first-page":"609","volume":"10","author":"M. Christodoulakis","year":"2005","unstructured":"Christodoulakis, M., Iliopoulos, C.S., Park, K., Sim, J.S.: Approximate seeds of strings. Journal of Automata, Languages and Combinatorics\u00a010(5\/6), 609\u2013626 (2005)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"50","key":"20_CR5","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. Theor. Comput. Sci.\u00a0410(50), 5227\u20135235 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific (2003)","DOI":"10.1142\/4838"},{"issue":"3","key":"20_CR7","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(3), 288\u2013297 (1996)","journal-title":"Algorithmica"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Kociumaka, T., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: A linear time algorithm for seeds computation. In: Rabani, Y. (ed.) SODA, pp. 1095\u20131112. SIAM (2012)","DOI":"10.1137\/1.9781611973099.86"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-38905-4_18","volume-title":"Combinatorial Pattern Matching","author":"T. Kociumaka","year":"2013","unstructured":"Kociumaka, T., Pissis, S.P., Radoszewski, J., Rytter, W., Wale\u0144, T.: Fast algorithm for partial covers in words. In: Fischer, J., Sanders, P. (eds.) CPM 2013. LNCS, vol.\u00a07922, pp. 177\u2013188. Springer, Heidelberg (2013)"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Kociumaka, T., Pissis, S.P., Radoszewski, J., Rytter, W., Wale\u0144, T.: Fast algorithm for partial covers in words. In: ArXiv e-prints, arXiv:1401.0163 [cs.DS] (December 2013)","DOI":"10.1007\/978-3-642-38905-4_18"},{"issue":"1","key":"20_CR11","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"},{"issue":"5","key":"20_CR12","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. Inf. Process. Lett.\u00a050(5), 239\u2013246 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"20_CR13","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"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07566-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:23:31Z","timestamp":1558909411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}