{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:22:14Z","timestamp":1720624934220},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1016\/j.jda.2013.06.009","type":"journal-article","created":{"date-parts":[[2013,7,10]],"date-time":"2013-07-10T19:45:29Z","timestamp":1373485529000},"page":"119-142","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Computing the partial word avoidability indices of ternary patterns"],"prefix":"10.1016","volume":"23","author":[{"given":"F.","family":"Blanchet-Sadri","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Lohr","sequence":"additional","affiliation":[]},{"given":"Shane","family":"Scott","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jda.2013.06.009_br0010","doi-asserted-by":"crossref","first-page":"261","DOI":"10.2140\/pjm.1979.85.261","article-title":"Avoidable patterns in strings of symbols","volume":"85","author":"Bean","year":"1979","journal-title":"Pacific Journal of Mathematics"},{"key":"10.1016\/j.jda.2013.06.009_br0020","series-title":"Algorithmic Combinatorics on Partial Words","author":"Blanchet-Sadri","year":"2008"},{"key":"10.1016\/j.jda.2013.06.009_br0030","series-title":"LATA 2011, 5th International Conference on Language and Automata Theory and Applications","first-page":"155","article-title":"Unary pattern avoidance in partial words dense with holes","volume":"vol. 6638","author":"Blanchet-Sadri","year":"2011"},{"key":"10.1016\/j.jda.2013.06.009_br0040","series-title":"IWOCA 2012, 23rd International Workshop on Combinatorial Algorithms, Tamil Nadu, India","first-page":"206","article-title":"Computing the partial word avoidability indices of ternary patterns","volume":"vol. 7643","author":"Blanchet-Sadri","year":"2012"},{"key":"10.1016\/j.jda.2013.06.009_br0050","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.jda.2013.06.007","article-title":"Computing the partial word avoidability indices of binary patterns","volume":"23","author":"Blanchet-Sadri","year":"2013","journal-title":"Journal of Discrete Algorithms"},{"key":"10.1016\/j.jda.2013.06.009_br0060","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s00236-010-0129-0","article-title":"Avoidable binary patterns in partial words","volume":"48","author":"Blanchet-Sadri","year":"2011","journal-title":"Acta Informatica"},{"key":"10.1016\/j.jda.2013.06.009_br0070","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01209712","article-title":"Unavoidable binary patterns","volume":"30","author":"Cassaigne","year":"1993","journal-title":"Acta Informatica"},{"key":"10.1016\/j.jda.2013.06.009_br0080","series-title":"Motifs \u00e9vitables et r\u00e9gularit\u00e9s dans les mots","author":"Cassaigne","year":"1994"},{"key":"10.1016\/j.jda.2013.06.009_br0090","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1142\/S0218196706002950","article-title":"The existence of a pattern which is 5-avoidable but 4-unavoidable","volume":"16","author":"Clark","year":"2006","journal-title":"International Journal of Algebra and Computation"},{"key":"10.1016\/j.jda.2013.06.009_br0100","series-title":"Combinatorics on Words","author":"Lothaire","year":"1997"},{"key":"10.1016\/j.jda.2013.06.009_br0110","series-title":"Algebraic Combinatorics on Words","author":"Lothaire","year":"2002"},{"key":"10.1016\/j.jda.2013.06.009_br0120","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1051\/ita:2006020","article-title":"A generator of morphisms for infinite words","volume":"40","author":"Ochem","year":"2006","journal-title":"RAIRO \u2013 Theoretical Informatics and Applications"},{"key":"10.1016\/j.jda.2013.06.009_br0130","series-title":"WORDS 2011, 8th International Conference on Words","first-page":"30","article-title":"Pattern avoidance and HDOL words","volume":"vol. 63","author":"Ochem","year":"2011"},{"key":"10.1016\/j.jda.2013.06.009_br0140","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1070\/SM1984v047n02ABEH002647","article-title":"Blocking sets of terms","volume":"47","author":"Zimin","year":"1984","journal-title":"Mathematics of the USSR \u2013 Sbornik"}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866713000464?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866713000464?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,14]],"date-time":"2018-10-14T17:30:41Z","timestamp":1539538241000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866713000464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":14,"alternative-id":["S1570866713000464"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.jda.2013.06.009","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2013,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Computing the partial word avoidability indices of ternary patterns","name":"articletitle","label":"Article Title"},{"value":"Journal of Discrete Algorithms","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jda.2013.06.009","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}
