{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:18:00Z","timestamp":1725466680127},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316524"},{"type":"electronic","value":"9783642316531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31653-1_36","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T09:51:39Z","timestamp":1342259499000},"page":"404-415","source":"Crossref","is-referenced-by-count":3,"title":["Squares in Binary Partial Words"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[]},{"given":"Yang","family":"Jiao","sequence":"additional","affiliation":[]},{"given":"John M.","family":"Machacek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","volume-title":"Algorithmic Combinatorics on Partial Words","author":"F. Blanchet-Sadri","year":"2008","unstructured":"Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall\/CRC Press, Boca Raton, FL (2008)"},{"key":"36_CR2","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. RAIRO-Theoretical Informatics and Applications\u00a043, 767\u2013774 (2009)","journal-title":"RAIRO-Theoretical Informatics and Applications"},{"key":"36_CR3","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 Cybernetica\u00a019, 465\u2013477 (2009)","journal-title":"Acta Cybernetica"},{"key":"36_CR4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.37236\/1196","volume":"2","author":"A.S. Fraenkel","year":"1995","unstructured":"Fraenkel, A.S., Simpson, R.J.: How many squares must a binary sequence contain? Electronic Journal of Combinatorics\u00a02, R2 (1995)","journal-title":"Electronic Journal of Combinatorics"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1006\/jcta.1997.2843","volume":"82","author":"A.S. Fraenkel","year":"1998","unstructured":"Fraenkel, A.S., Simpson, R.J.: How many squares can a string contain? Journal of Combinatorial Theory, Series A\u00a082, 112\u2013120 (1998)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"36_CR6","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-Theoretical Informatics and Applications\u00a044, 125\u2013138 (2010)","journal-title":"RAIRO-Theoretical Informatics and Applications"},{"key":"36_CR7","doi-asserted-by":"crossref","first-page":"6","DOI":"10.37236\/493","volume":"18","author":"T. Harju","year":"2011","unstructured":"Harju, T., K\u00e4rki, T., Nowotka, D.: The number of positions starting a square in binary words. Electronic Journal of Combinatorics\u00a018, P6 (2011)","journal-title":"Electronic Journal of Combinatorics"},{"key":"36_CR8","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. Journal of Combinatorial Theory, Series A\u00a0112, 163\u2013164 (2005)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.tcs.2007.03.025","volume":"380","author":"L. Ilie","year":"2007","unstructured":"Ilie, L.: A note on the number of squares in a word. Theoretical Computer Science\u00a0380, 373\u2013376 (2007)","journal-title":"Theoretical Computer Science"},{"key":"36_CR10","doi-asserted-by":"crossref","first-page":"12","DOI":"10.37236\/1705","volume":"10","author":"G. Kucherov","year":"2003","unstructured":"Kucherov, G., Ochem, P., Rao, M.: How many square occurrences must a binary sequence contain? Electronic Journal of Combinatorics\u00a010, R12 (2003)","journal-title":"Electronic Journal of Combinatorics"},{"key":"36_CR11","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":"36_CR12","unstructured":"Ochem, P., Rao, M.: Minimum frequencies of occurrences of squares and letters in infinite words. In: JM 2008, 12i\u00e8mes Journ\u00e9es Montoises d\u2019Informatique Th\u00e9orique, Mons, Belgium (2008)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31653-1_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:41:38Z","timestamp":1620128498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31653-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316524","9783642316531"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31653-1_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}