{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:43:01Z","timestamp":1725698581852},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325885"},{"type":"electronic","value":"9783642325892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32589-2_21","type":"book-chapter","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T08:44:32Z","timestamp":1343810672000},"page":"210-221","source":"Crossref","is-referenced-by-count":1,"title":["Abelian Pattern Avoidance in Partial Words"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sean","family":"Simmons","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00255-2","volume":"218","author":"J. Berstel","year":"1999","unstructured":"Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theoretical Computer Science\u00a0218, 135\u2013141 (1999)","journal-title":"Theoretical Computer Science"},{"key":"21_CR2","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":"21_CR3","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.jcta.2011.08.008","volume":"119","author":"F. Blanchet-Sadri","year":"2012","unstructured":"Blanchet-Sadri, F., Kim, J.I., Merca\u015f, R., Severa, W., Simmons, S., Xu, D.: Avoiding abelian squares in partial words. Journal of Combinatorial Theory, Series A\u00a0119, 257\u2013270 (2012)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.aam.2011.06.006","volume":"48","author":"F. Blanchet-Sadri","year":"2012","unstructured":"Blanchet-Sadri, F., Simmons, S., Xu, D.: Abelian repetitions in partial words. Advances in Applied Mathematics\u00a048, 194\u2013214 (2012)","journal-title":"Advances in Applied Mathematics"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"696","DOI":"10.4153\/CJM-2001-028-4","volume":"53","author":"J. Currie","year":"2001","unstructured":"Currie, J., Linek, V.: Avoiding patterns in the abelian sense. Canadian Journal of Mathematics\u00a053, 696\u2013714 (2001)","journal-title":"Canadian Journal of Mathematics"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s00236-006-0030-z","volume":"43","author":"J. Currie","year":"2007","unstructured":"Currie, J., Visentin, T.: On abelian 2-avoidable binary patterns. Acta Informatica\u00a043, 521\u2013533 (2007)","journal-title":"Acta Informatica"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.tcs.2008.08.039","volume":"409","author":"J. Currie","year":"2008","unstructured":"Currie, J., Visentin, T.: Long binary patterns are abelian 2-avoidable. Theoretical Computer Science\u00a0409, 432\u2013437 (2008)","journal-title":"Theoretical Computer Science"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.tcs.2005.01.004","volume":"339","author":"J.D. Currie","year":"2005","unstructured":"Currie, J.D.: Pattern avoidance: themes and variations. Theoretical Computer Science\u00a0339, 7\u201318 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0097-3165(79)90044-X","volume":"27","author":"F.M. Dekking","year":"1979","unstructured":"Dekking, F.M.: Strongly non-repetitive sequences and progression-free sets. Journal of Combinatorial Theory, Series A\u00a027(2), 181\u2013185 (1979)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"21_CR10","first-page":"221","volume":"6","author":"P. Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P.: Some unsolved problems. Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zete K\u00f6zl.\u00a06, 221\u2013254 (1961)","journal-title":"Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zete K\u00f6zl."},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-55719-9_62","volume-title":"Automata, Languages and Programming","author":"V. Ker\u00e4nen","year":"1992","unstructured":"Ker\u00e4nen, V.: Abelian Squares are Avoidable on 4 Letters. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 41\u201352. Springer, Heidelberg (1992)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/11493785_20","volume-title":"DNA Computing","author":"P. Leupold","year":"2005","unstructured":"Leupold, P.: Partial Words for DNA Coding. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol.\u00a03384, pp. 224\u2013234. Springer, Heidelberg (2005)"},{"key":"21_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"21_CR14","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana\u00a07, 1\u201322 (1906)","journal-title":"Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32589-2_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:08:02Z","timestamp":1620130082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32589-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325885","9783642325892"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32589-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}