{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:44:32Z","timestamp":1648903472956},"reference-count":18,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1051\/ita\/2014014","type":"journal-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T08:11:14Z","timestamp":1402387874000},"page":"315-339","source":"Crossref","is-referenced-by-count":1,"title":["Abelian pattern avoidance in partial words"],"prefix":"10.1051","volume":"48","author":[{"given":"F.","family":"Blanchet-Sadri","sequence":"first","affiliation":[]},{"given":"Benjamin","family":"De Winkle","sequence":"additional","affiliation":[]},{"given":"Sean","family":"Simmons","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2014,6,10]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"Berstel J. and Boasson L., Partial words and a theorem of Fine and Wilf.Theoret. Comput. Sci.218(1999) 135\u2013141.","DOI":"10.1016\/S0304-3975(98)00255-2"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"F. Blanchet-Sadri,Algorithmic Combinatorics on Partial Words. Chapman & Hall\/CRC Press, Boca Raton, FL (2008).","DOI":"10.1201\/9781420060935"},{"key":"R3","unstructured":"F. Blanchet-Sadri and S. Simmons, Abelian pattern avoidance in partial words, inMFCS 2012, 37th International Symposium on Mathematical Foundations of Computer Science. Edited by B. Rovan, V. Sassone and P. Widmayer. Vol. 7464 ofLect. Notes Comput. Sci.Springer-Verlag, Berlin (2012) 210\u2013221."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Blanchet-Sadri F., Kim J.I., Merca\u015f R., Severa W., Simmons S. and Xu D., Avoiding abelian squares in partial words.J. Combin. Theory, Ser. A119(2012) 257\u2013270.","DOI":"10.1016\/j.jcta.2011.08.008"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Blanchet-Sadri F., Lohr A. and Scott S., Computing the partial word avoidability indices of binary patterns.J. Discrete Algorithms23(2013) 113\u2013118","DOI":"10.1016\/j.jda.2013.06.007"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Blanchet-Sadri F., A. Lohr and S. Scott. Computing the partial word avoidability indices of ternary patterns.J. Discrete Algorithms23(2013) 119\u2013142","DOI":"10.1016\/j.jda.2013.06.009"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"Blanchet-Sadri F., Simmons S. and Xu D., Abelian repetitions in partial words.Adv. Appl. Math.48(2012) 194\u2013214.","DOI":"10.1016\/j.aam.2011.06.006"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Currie J.D., Pattern avoidance: themes and variations.Theoret. Comput. Sci.339(2005) 7\u201318.","DOI":"10.1016\/j.tcs.2005.01.004"},{"key":"R9","unstructured":"Currie J. and Linek V., Avoiding patterns in the abelian sense.Can. J. Math.53(2001) 696\u2013714."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Currie J. and Visentin T., On abelian 2-avoidable binary patterns.Acta Informatica43(2007) 521\u2013533.","DOI":"10.1007\/s00236-006-0030-z"},{"key":"R11","unstructured":"Currie J. and Visentin T., Long binary patterns are abelian 2-avoidable.Theoret. Comput. Sci.409(2008) 432\u2013437."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Dekking F.M., Strongly non-repetitive sequences and progression-free sets.J. Combin. Theory, Ser. A27(1979) 181\u2013185.","DOI":"10.1016\/0097-3165(79)90044-X"},{"key":"R13","unstructured":"Erd\u0151s P., Some unsolved problems.Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zete K\u00f6zl.6(1961) 221\u2013254."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"V. Ker\u00e4nen, Abelian squares are avoidable on 4 letters, inICALP 1992, 19th International Colloquium on Automata, Languages and Programming. Edited by W. Kuich, vol. 623 ofLect. Notes Comput. Sci.Springer-Verlag, Berlin (1992) 41\u201352.","DOI":"10.1007\/3-540-55719-9_62"},{"key":"R15","unstructured":"P. Leupold, Partial words for DNA coding, in10th International Workshop on DNA Computing. Edited by G. Rozenberg, P. Yin, E. Winfree, J.H. Reif, B.-T. Zhang, M.H. Garzon, M. Cavaliere, M.J. P\u00e9rez-Jim\u00e9nez, L. Kari and S. Sahu. Vol. 3384 ofLect. Notes Comput. Sci.Springer-Verlag, Berlin (2005) 224\u2013234."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"M. Lothaire,Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002).","DOI":"10.1017\/CBO9781107326019"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"Pleasants P.A.B., Non repetitive sequences.Proc. Cambridge Philosophical Soc.68(1970) 267\u2013274.","DOI":"10.1017\/S0305004100046077"},{"key":"R18","unstructured":"Thue A., \u00dcber unendliche Zeichenreihen.Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana7(1906) 1\u201322."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2014014\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T11:02:02Z","timestamp":1565521322000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2014014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,10]]},"references-count":18,"journal-issue":{"issue":"3"},"alternative-id":["ita140012"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2014014","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,10]]}}}