{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:57:36Z","timestamp":1725771456236},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319049205"},{"type":"electronic","value":"9783319049212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04921-2_14","type":"book-chapter","created":{"date-parts":[[2014,2,5]],"date-time":"2014-02-05T13:52:25Z","timestamp":1391608345000},"page":"173-185","source":"Crossref","is-referenced-by-count":1,"title":["Computing Depths of Patterns"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Lohr","sequence":"additional","affiliation":[]},{"given":"Sean","family":"Simmons","sequence":"additional","affiliation":[]},{"given":"Brent","family":"Woodhouse","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"261","DOI":"10.2140\/pjm.1979.85.261","volume":"85","author":"D.R. Bean","year":"1979","unstructured":"Bean, D.R., Ehrenfeucht, A., McNulty, G.: Avoidable patterns in strings of symbols. Pacific Journal of Mathematics\u00a085, 261\u2013294 (1979)","journal-title":"Pacific Journal of Mathematics"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-21254-3_11","volume-title":"Language and Automata Theory and Applications","author":"F. Blanchet-Sadri","year":"2011","unstructured":"Blanchet-Sadri, F., Black, K., Zemke, A.: Unary pattern avoidance in partial words dense with holes. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 155\u2013166. Springer, Heidelberg (2011)"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.jda.2013.06.007","volume":"23","author":"F. Blanchet-Sadri","year":"2013","unstructured":"Blanchet-Sadri, F., Lohr, A., Scott, S.: Computing the partial word avoidability indices of binary patterns. Journal of Discrete Algorithms\u00a023, 113\u2013118 (2013)","journal-title":"Journal of Discrete Algorithms"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jda.2013.06.009","volume":"23","author":"F. Blanchet-Sadri","year":"2013","unstructured":"Blanchet-Sadri, F., Lohr, A., Scott, S.: Computing the partial word avoidability indices of ternary patterns. Journal of Discrete Algorithms\u00a023, 119\u2013142 (2013)","journal-title":"Journal of Discrete Algorithms"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00236-010-0129-0","volume":"48","author":"F. Blanchet-Sadri","year":"2011","unstructured":"Blanchet-Sadri, F., Merca\u015f, R., Simmons, S., Weissenstein, E.: Avoidable binary patterns in partial words. Acta Informatica\u00a048, 25\u201341 (2011)","journal-title":"Acta Informatica"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-32589-2_21","volume-title":"Mathematical Foundations of Computer Science 2012","author":"F. Blanchet-Sadri","year":"2012","unstructured":"Blanchet-Sadri, F., Simmons, S.: Abelian pattern avoidance in partial words. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 210\u2013221. Springer, Heidelberg (2012)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2013.08.010","volume":"506","author":"F. Blanchet-Sadri","year":"2013","unstructured":"Blanchet-Sadri, F., Woodhouse, B.: Strict bounds for pattern avoidance. Theoretical Computer Science\u00a0506, 17\u201328 (2013)","journal-title":"Theoretical Computer Science"},{"key":"14_CR8","unstructured":"Cassaigne, J.: Motifs \u00e9vitables et r\u00e9gularit\u00e9s dans les mots. Ph.D. thesis, Paris VI (1994)"},{"key":"14_CR9","doi-asserted-by":"publisher","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":"14_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.tcs.2007.09.028","volume":"389","author":"F. Manea","year":"2007","unstructured":"Manea, F., Merca\u015f, R.: Freeness of partial words. Theoretical Computer Science\u00a0389, 265\u2013277 (2007)","journal-title":"Theoretical Computer Science"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1051\/ita:2006020","volume":"40","author":"P. Ochem","year":"2006","unstructured":"Ochem, P.: A generator of morphisms for infinite words. RAIRO-Theoretical Informatics and Applications\u00a040, 427\u2013441 (2006)","journal-title":"RAIRO-Theoretical Informatics and Applications"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1070\/SM1984v047n02ABEH002647","volume":"47","author":"A.I. Zimin","year":"1984","unstructured":"Zimin, A.I.: Blocking sets of terms. Mathematics of the USSR-Sbornik\u00a047, 353\u2013364 (1984)","journal-title":"Mathematics of the USSR-Sbornik"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04921-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T05:57:32Z","timestamp":1558850252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04921-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319049205","9783319049212"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04921-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}