{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T04:05:55Z","timestamp":1750478755932,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319623887"},{"type":"electronic","value":"9783319623894"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62389-4_9","type":"book-chapter","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T15:07:46Z","timestamp":1498835266000},"page":"99-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes"],"prefix":"10.1007","author":[{"given":"Panagiotis","family":"Charalampopoulos","sequence":"first","affiliation":[]},{"given":"Maxime","family":"Crochemore","sequence":"additional","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Kociumaka","sequence":"additional","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","published-online":{"date-parts":[[2017,7,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Bannai, H., I, T., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: A new characterization of maximal repetitions by Lyndon trees. In: Indyk, P. (ed.) 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, pp. 562\u2013571. SIAM (2015)","DOI":"10.1137\/1.9781611973730.38"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.dam.2014.12.003","volume":"185","author":"F Blanchet-Sadri","year":"2015","unstructured":"Blanchet-Sadri, F., Bodnar, M., Nikkel, J., Quigley, J.D., Zhang, X.: Squares and primitivity in partial words. Discrete Appl. Math. 185, 26\u201337 (2015)","journal-title":"Discrete Appl. Math."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2014.02.023","volume":"530","author":"F Blanchet-Sadri","year":"2014","unstructured":"Blanchet-Sadri, F., Jiao, Y., Machacek, J.M., Quigley, J., Zhang, X.: Squares in partial words. Theor. Comput. Sci. 530, 42\u201357 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1051\/ita\/2009019","volume":"43","author":"F Blanchet-Sadri","year":"2009","unstructured":"Blanchet-Sadri, F., Merca\u015f, R.: A note on the number of squares in a partial word with one hole. Inform. Theor. Appl. 43(4), 767\u2013774 (2009)","journal-title":"Inform. Theor. Appl."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.01.012","volume":"428","author":"F Blanchet-Sadri","year":"2012","unstructured":"Blanchet-Sadri, F., Merca\u015f, R.: The three-squares lemma for partial words with one hole. Theor. Comput. Sci. 428, 1\u20139 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9_CR6","first-page":"465","volume":"19","author":"F Blanchet-Sadri","year":"2009","unstructured":"Blanchet-Sadri, F., Merca\u015f, R., Scott, G.: Counting distinct squares in partial words. Acta Cybern. 19(2), 465\u2013477 (2009)","journal-title":"Acta Cybern."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-319-19315-1_8","volume-title":"Combinatorial Algorithms","author":"F Blanchet-Sadri","year":"2015","unstructured":"Blanchet-Sadri, F., Nikkel, J., Quigley, J.D., Zhang, X.: Computing primitively-rooted squares and runs in partial words. In: Kratochv\u00edl, J., Miller, M., Froncek, D. (eds.) IWOCA 2014. LNCS, vol. 8986, pp. 86\u201397. Springer, Cham (2015). doi:10.1007\/978-3-319-19315-1_8"},{"key":"9_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.jda.2015.05.003","volume":"34","author":"M Crochemore","year":"2015","unstructured":"Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Langiu, A., Radoszewski, J., Rytter, W., Szreder, B., Wale\u0144, T.: A note on the longest common compatible prefix problem for partial words. J. Discrete Algorithms 34, 49\u201353 (2015)","journal-title":"J. Discrete Algorithms"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2013.11.018","volume":"521","author":"M Crochemore","year":"2014","unstructured":"Crochemore, M., Iliopoulos, C.S., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci. 521, 29\u201341 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"9_CR11","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01190846","volume":"13","author":"M Crochemore","year":"1995","unstructured":"Crochemore, M., Rytter, W.: Squares, cubes, and time-space efficient string searching. Algorithmica 13(5), 405\u2013425 (1995)","journal-title":"Algorithmica"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.dam.2014.08.016","volume":"180","author":"A Deza","year":"2015","unstructured":"Deza, A., Franek, F., Thierry, A.: How many double squares can a string contain? Discrete Appl. Math. 180, 52\u201369 (2015)","journal-title":"Discrete Appl. Math."},{"key":"9_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. 5699, pp. 96\u2013108. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-03409-1_10"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"AS Fraenkel","year":"1998","unstructured":"Fraenkel, A.S., Simpson, J.: How many squares can a string contain? J. Comb. Theory, Ser. A 82(1), 112\u2013120 (1998)","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.jcss.2004.03.004","volume":"69","author":"D Gusfield","year":"2004","unstructured":"Gusfield, D., Stoye, J.: Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci. 69(4), 525\u2013546 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1051\/ita\/2010008","volume":"44","author":"V Halava","year":"2010","unstructured":"Halava, V., Harju, T., K\u00e4rki, T.: On the number of squares in partial words. RAIRO Theor. Inform. Appl. 44(1), 125\u2013138 (2010)","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.jcta.2005.01.006","volume":"112","author":"L Ilie","year":"2005","unstructured":"Ilie, L.: A simple proof that a word of length $$n$$ has at most $$2n$$ distinct squares. J. Comb. Theory, Ser. A 112(1), 163\u2013164 (2005)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"9_CR18","unstructured":"Kociumaka, T.: Minimal suffix and rotation of a substring in optimal time. In: Grossi, R., Lewenstein, M. (eds.) Combinatorial Pattern Matching, CPM 2016. LIPIcs, vol. 54, pp. 28:1\u201328:12. Schloss Dagstuhl (2016)"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Kolpakov, R.M., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: 40th Annual Symposium on Foundations of Computer Science, FOCS 1999, pp. 596\u2013604. IEEE Computer Society (1999)","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.dam.2014.07.017","volume":"179","author":"F Manea","year":"2014","unstructured":"Manea, F., Merca\u015f, R., Tiseanu, C.: An algorithmic toolbox for periodic partial words. Discrete Appl. Math. 179, 174\u2013192 (2014)","journal-title":"Discrete Appl. Math."},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-642-13089-2_36","volume-title":"Language and Automata Theory and Applications","author":"F Manea","year":"2010","unstructured":"Manea, F., Tiseanu, C.: Hard counting problems for partial words. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 426\u2013438. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-13089-2_36"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62389-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T19:19:00Z","timestamp":1750447140000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62389-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319623887","9783319623894"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62389-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"1 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2017.comp.polyu.edu.hk\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}