{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:36:48Z","timestamp":1720201008146},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,4,17]],"date-time":"2018-04-17T00:00:00Z","timestamp":1523923200000},"content-version":"vor","delay-in-days":1477,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"National Science Foundation","award":["DMS-1060775"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1016\/j.tcs.2014.02.023","type":"journal-article","created":{"date-parts":[[2014,2,25]],"date-time":"2014-02-25T22:46:02Z","timestamp":1393368362000},"page":"42-57","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Squares in partial words"],"prefix":"10.1016","volume":"530","author":[{"given":"F.","family":"Blanchet-Sadri","sequence":"first","affiliation":[]},{"given":"Yang","family":"Jiao","sequence":"additional","affiliation":[]},{"given":"John M.","family":"Machacek","sequence":"additional","affiliation":[]},{"given":"J.D.","family":"Quigley","sequence":"additional","affiliation":[]},{"given":"Xufan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2014.02.023_br0020","series-title":"Algorithmic Combinatorics on Partial Words","author":"Blanchet-Sadri","year":"2008"},{"key":"10.1016\/j.tcs.2014.02.023_br0030","series-title":"DLT 2012, 16th International Conference on Developments in Language Theory","first-page":"404","article-title":"Squares in binary partial words","volume":"vol. 7410","author":"Blanchet-Sadri","year":"2012"},{"key":"10.1016\/j.tcs.2014.02.023_br0040","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1051\/ita\/2009019","article-title":"A note on the number of squares in a partial word with one hole","volume":"43","author":"Blanchet-Sadri","year":"2009","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"10.1016\/j.tcs.2014.02.023_br0050","first-page":"465","article-title":"Counting distinct squares in partial words","volume":"19","author":"Blanchet-Sadri","year":"2009","journal-title":"Acta Cybernet."},{"key":"10.1016\/j.tcs.2014.02.023_br0060","doi-asserted-by":"crossref","first-page":"R2","DOI":"10.37236\/1196","article-title":"How many squares must a binary sequence contain?","volume":"2","author":"Fraenkel","year":"1995","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.tcs.2014.02.023_br0070","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1006\/jcta.1997.2843","article-title":"How many squares can a string contain?","volume":"82","author":"Fraenkel","year":"1998","journal-title":"J. Comb. Theory Ser. A"},{"key":"10.1016\/j.tcs.2014.02.023_br0080","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1051\/ita\/2010008","article-title":"On the number of squares in partial words","volume":"44","author":"Halava","year":"2010","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"10.1016\/j.tcs.2014.02.023_br0090","doi-asserted-by":"crossref","first-page":"P6","DOI":"10.37236\/493","article-title":"The number of positions starting a square in binary words","volume":"18","author":"Harju","year":"2011","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.tcs.2014.02.023_br0100","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.jcta.2005.01.006","article-title":"A simple proof that a word of length n has at most 2n distinct squares","volume":"112","author":"Ilie","year":"2005","journal-title":"J. Comb. Theory Ser. A"},{"key":"10.1016\/j.tcs.2014.02.023_br0110","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.tcs.2007.03.025","article-title":"A note on the number of squares in a word","volume":"380","author":"Ilie","year":"2007","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2014.02.023_br0120","doi-asserted-by":"crossref","first-page":"R12","DOI":"10.37236\/1705","article-title":"How many square occurrences must a binary sequence contain?","volume":"10","author":"Kucherov","year":"2003","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.tcs.2014.02.023_br0130","series-title":"Combinatorics on Words","author":"Lothaire","year":"1997"},{"key":"10.1016\/j.tcs.2014.02.023_br0140","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/j.tcs.2007.03.027","article-title":"Letter frequencies in infinite repetition-free words","volume":"380","author":"Ochem","year":"2007","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2014.02.023_br0150","series-title":"JM 2008, 12i\u00e8mes Journ\u00e9es Montoises d'Informatique Th\u00e9orique","article-title":"Minimum frequencies of occurrences of squares and letters in infinite words","author":"Ochem","year":"2008"},{"key":"10.1016\/j.tcs.2014.02.023_br0160","first-page":"1","article-title":"\u00dcber unendliche Zeichenreihen","volume":"7","author":"Thue","year":"1906","journal-title":"Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514001297?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514001297?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,8,15]],"date-time":"2020-08-15T19:32:27Z","timestamp":1597519947000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397514001297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":15,"alternative-id":["S0304397514001297"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2014.02.023","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2014,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Squares in partial words","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2014.02.023","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}