{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:10:06Z","timestamp":1773277806380,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642135613","type":"print"},{"value":"9783642135620","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13562-0_13","type":"book-chapter","created":{"date-parts":[[2010,5,31]],"date-time":"2010-05-31T09:08:30Z","timestamp":1275296910000},"page":"128-138","source":"Crossref","is-referenced-by-count":3,"title":["Binary De Bruijn Partial Words with One Hole"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jarett","family":"Schwartz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Slater","family":"Stich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin J.","family":"Wyatt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences: Theory, Applications, Generalizations","author":"J.P. Allouche","year":"2003","unstructured":"Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.36045\/bbms\/1103408543","volume":"1","author":"J.P. Allouche","year":"1994","unstructured":"Allouche, J.P.: Sur la complexit\u00e9 des suites infinies. Bulletin of the Belgian Mathematical Society\u00a01, 133\u2013143 (1994)","journal-title":"Bulletin of the Belgian Mathematical Society"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0012-365X(98)00400-2","volume":"206","author":"S. Ferenczi","year":"1999","unstructured":"Ferenczi, S.: Complexity of sequences and dynamical systems. Discrete Mathematics\u00a0206, 145\u2013154 (1999)","journal-title":"Discrete Mathematics"},{"key":"13_CR4","first-page":"67","volume":"4","author":"J. Cassaigne","year":"1997","unstructured":"Cassaigne, J.: Complexit\u00e9 et facteurs sp\u00e9ciaux. Bulletin of the Belgium Mathematical Society\u00a04, 67\u201388 (1997)","journal-title":"Bulletin of the Belgium Mathematical Society"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.aam.2006.04.001","volume":"39","author":"I. Gheorghiciuc","year":"2007","unstructured":"Gheorghiciuc, I.: The subword complexity of a class of infinite binary words. Advances in Applied Mathematics\u00a039, 237\u2013259 (2007)","journal-title":"Advances in Applied Mathematics"},{"key":"13_CR6","unstructured":"De Bruijn, N.G.: Acknowledgement of priority to C. Flye Sainte-Marie on the counting of circular arrangements of 2n zeros and ones that show each n-letter word exactly once. Technical Report 75\u2013WSK\u201306, Department of Mathematics and Computing Science, Eindhoven University of Technology, The Netherlands (1975)"},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/TCBB.2007.1002","volume":"4","author":"M.A. Alekseyev","year":"2007","unstructured":"Alekseyev, M.A., Pevzner, P.A.: Colored de Bruijn graphs and the genome halving problem. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a04(1), 98\u2013107 (2007)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-3-642-02737-6_9","volume-title":"DLT 2009","author":"B. Blakeley","year":"2009","unstructured":"Blakeley, B., Blanchet-Sadri, F., Gunter, J., Rampersad, N.: On the complexity of deciding avoidability of sets of partial words. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 113\u2013124. Springer, Heidelberg (2009), www.uncg.edu\/cmp\/research\/unavoidablesets3"},{"key":"13_CR9","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 (2008)"},{"key":"13_CR10","volume-title":"Handbook of Graph Theory","author":"J.L. Gross","year":"2004","unstructured":"Gross, J.L., Yellen, J.: Handbook of Graph Theory. CRC Press, Boca Raton (2004)"},{"key":"13_CR11","volume-title":"Enumerative Combinatorics","author":"R.P. Stanley","year":"2001","unstructured":"Stanley, R.P.: Enumerative Combinatorics, vol.\u00a02. Cambridge University Press, Cambridge (2001)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13562-0_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:40:01Z","timestamp":1606185601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13562-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135613","9783642135620"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13562-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}