{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:09Z","timestamp":1759639089155},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642009815"},{"type":"electronic","value":"9783642009822"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00982-2_15","type":"book-chapter","created":{"date-parts":[[2009,3,30]],"date-time":"2009-03-30T19:51:54Z","timestamp":1238442714000},"page":"176-187","source":"Crossref","is-referenced-by-count":0,"title":["How Many Holes Can an Unbordered Partial Word Contain?"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emily","family":"Allen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cameron","family":"Byrum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Merca\u015f","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_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":"15_CR2","doi-asserted-by":"crossref","unstructured":"Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall\/CRC Press (2007)","DOI":"10.1201\/9781420060935"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.dam.2005.03.001","volume":"148","author":"F. Blanchet-Sadri","year":"2005","unstructured":"Blanchet-Sadri, F.: Primitive partial words. Discrete Applied Mathematics\u00a0148, 195\u2013213 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Blanchet-Sadri, F., Davis, C., Dodge, J., Merca\u015f, R., Moorefield, M.: Unbordered partial words. Discrete Applied Mathematics (2008), doi:10.1016\/j.dam.2008.04.004","DOI":"10.1016\/j.dam.2008.04.004"},{"key":"15_CR5","first-page":"11","volume-title":"New Developments in Formal Languages and Applications","author":"F. Blanchet-Sadri","year":"2007","unstructured":"Blanchet-Sadri, F.: Open problems on partial words. In: Bel-Enguix, G., Jim\u00e9nez-L\u00f3pez, M., Mart\u00edn-Vide, C. (eds.) New Developments in Formal Languages and Applications, pp. 11\u201358. Springer, Berlin (2007)"}],"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-642-00982-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T08:21:20Z","timestamp":1551946880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00982-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642009815","9783642009822"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00982-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}