{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:25:22Z","timestamp":1725600322316},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229923"},{"type":"electronic","value":"9783642229930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22993-0_43","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:44:46Z","timestamp":1312893886000},"page":"472-484","source":"Crossref","is-referenced-by-count":1,"title":["Periodicity Algorithms for Partial Words"],"prefix":"10.1007","author":[{"given":"Florin","family":"Manea","sequence":"first","affiliation":[]},{"given":"Robert","family":"Merca\u015f","sequence":"additional","affiliation":[]},{"given":"C\u0103t\u0103lin","family":"Tiseanu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-59136-5_6","volume-title":"Handbook of Formal Languages","author":"C. Choffrut","year":"1997","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 329\u2013438. Springer, Heidelberg (1997)"},{"key":"43_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall\/CRC Press (2008)","DOI":"10.1201\/9781420060935"},{"key":"43_CR4","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0022-0000(83)90002-8","volume":"26","author":"Z. Galil","year":"1983","unstructured":"Galil, Z., Seiferas, J.I.: Time-space optimal string matching. J. of Comput. and Syst. Sci.\u00a026, 280\u2013294 (1983)","journal-title":"J. of Comput. and Syst. Sci."},{"issue":"1","key":"43_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0304-3975(92)90134-2","volume":"92","author":"M. Crochemore","year":"1992","unstructured":"Crochemore, M.: String-matching on ordered alphabets. Theor. Comput. Sci.\u00a092(1), 33\u201347 (1992)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"43_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.dam.2006.07.001","volume":"155","author":"F. Blanchet-Sadri","year":"2007","unstructured":"Blanchet-Sadri, F., Anavekar, A.R.: Testing primitivity on partial words. Discr. Appl. Math.\u00a0155(3), 279\u2013287 (2007)","journal-title":"Discr. Appl. Math."},{"issue":"1-2","key":"43_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.tcs.2003.11.025","volume":"314","author":"F. Blanchet-Sadri","year":"2004","unstructured":"Blanchet-Sadri, F., Chriscoe, A.: Local periods and binary partial words: an algorithm. Theoret. Comput. Sci.\u00a0314(1-2), 189\u2013216 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Cole, R., Hariharan, R.: Verifying candidate matches in sparse and wildcard matching. In: STOC 2002, pp. 592\u2013601 (2002)","DOI":"10.1145\/509907.509992"},{"key":"43_CR9","unstructured":"Fischer, M.J., Paterson, M.S.: String matching and other products. In: Complexity of Computation, SIAM-AMS Proceedings, vol.\u00a07, pp. 113\u2013125 (1974)"},{"issue":"2","key":"43_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.ipl.2006.08.002","volume":"101","author":"P. Clifford","year":"2007","unstructured":"Clifford, P., Clifford, R.: Simple deterministic wildcard matching. Inform. Proc. Lett.\u00a0101(2), 53\u201354 (2007)","journal-title":"Inform. Proc. Lett."},{"issue":"1-2","key":"43_CR11","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.tcs.2007.09.028","volume":"389","author":"F. Manea","year":"2007","unstructured":"Manea, F., Merca\u015f, R.: Freeness of partial words. Theoret. Comput. Sci.\u00a0389(1-2), 265\u2013277 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"43_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-00982-2_16","volume-title":"Language and Automata Theory and Applications","author":"F. Blanchet-Sadri","year":"2009","unstructured":"Blanchet-Sadri, F., Merca\u015f, R., Rashin, A., Willett, E.: An answer to a conjecture on overlaps in partial words using periodicity algorithms. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 188\u2013199. Springer, Heidelberg (2009)"},{"key":"43_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-03409-1_10","volume-title":"Fundamentals of Computation Theory","author":"A. Diaconu","year":"2009","unstructured":"Diaconu, A., Manea, F., Tiseanu, C.: Combinatorial queries and updates on partial words. In: Kuty\u0142owski, M., Charatonik, W., G\u0119bala, M. (eds.) FCT 2009. LNCS, vol.\u00a05699, pp. 96\u2013108. Springer, Heidelberg (2009)"},{"key":"43_CR14","first-page":"179","volume":"7","author":"P. Leupold","year":"2004","unstructured":"Leupold, P.: Languages of partial words - how to obtain them and what properties they have. Grammars\u00a07, 179\u2013192 (2004)","journal-title":"Grammars"},{"key":"43_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/11493785_20","volume-title":"DNA Computing","author":"P. Leupold","year":"2005","unstructured":"Leupold, P.: Partial words for DNA coding. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol.\u00a03384, pp. 224\u2013234. Springer, Heidelberg (2005)"},{"key":"43_CR16","volume-title":"The Art of Computer Programming Fundamental Algorithms","author":"D.E. Knuth","year":"1968","unstructured":"Knuth, D.E.: The Art of Computer Programming Fundamental Algorithms, vol.\u00a01. Addison-Wesley, Reading (1968)"},{"issue":"3","key":"43_CR17","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inform. Proc. Lett.\u00a08(3), 121\u2013123 (1979)","journal-title":"Inform. Proc. Lett."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22993-0_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:10:17Z","timestamp":1606187417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22993-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229923","9783642229930"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22993-0_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}