{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:12Z","timestamp":1759639092512},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319663951"},{"type":"electronic","value":"9783319663968"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-66396-8_5","type":"book-chapter","created":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T09:57:59Z","timestamp":1502704679000},"page":"36-48","source":"Crossref","is-referenced-by-count":0,"title":["Minimal Forbidden Factors of Circular Words"],"prefix":"10.1007","author":[{"given":"Gabriele","family":"Fici","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Restivo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura","family":"Rizzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,15]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-48523-6_23","volume-title":"Automata, Languages and Programming","author":"M Crochemore","year":"1999","unstructured":"Crochemore, M., Mignosi, F., Restivo, A., Salemi, S.: Text compression using antidictionaries. In: Wiedermann, J., Boas, P.E., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 261\u2013270. Springer, Heidelberg (1999). doi:\n10.1007\/3-540-48523-6_23"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.tcs.2012.04.031","volume":"450","author":"S Chairungsee","year":"2012","unstructured":"Chairungsee, S., Crochemore, M.: Using minimal absent words to build phylogeny. Theor. Comput. Sci. 450, 109\u2013116 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1186\/s12859-014-0388-9","volume":"15","author":"C Barton","year":"2014","unstructured":"Barton, C., H\u00e9liou, A., Mouchard, L., Pissis, S.P.: Linear-time computation of minimal absent words using suffix array. BMC Bioinform. 15, 388 (2014)","journal-title":"BMC Bioinform."},{"issue":"2","key":"5_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1006\/aama.2000.0682","volume":"25","author":"M B\u00e9al","year":"2000","unstructured":"B\u00e9al, M., Mignosi, F., Restivo, A., Sciortino, M.: Forbidden words in symbolic dynamics. Adv. Appl. Math. 25(2), 163\u2013193 (2000)","journal-title":"Adv. Appl. Math."},{"issue":"1\u20132","key":"5_CR5","first-page":"121","volume":"56","author":"M B\u00e9al","year":"2003","unstructured":"B\u00e9al, M., Crochemore, M., Mignosi, F., Restivo, A., Sciortino, M.: Computing forbidden words of regular languages. Fundam. Inform. 56(1\u20132), 121\u2013135 (2003)","journal-title":"Fundam. Inform."},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0020-0190(98)00104-5","volume":"67","author":"M Crochemore","year":"1998","unstructured":"Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Inf. Process. Lett. 67, 111\u2013117 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"5_CR7","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0304-3975(00)00436-9","volume":"273","author":"F Mignosi","year":"2002","unstructured":"Mignosi, F., Restivo, A., Sciortino, M.: Words and forbidden factors. Theor. Comput. Sci. 273(1\u20132), 99\u2013117 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR8","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.tcs.2006.03.006","volume":"359","author":"G Fici","year":"2006","unstructured":"Fici, G., Mignosi, F., Restivo, A., Sciortino, M.: Word assembly through minimal forbidden words. Theor. Comput. Sci. 359(1), 214\u2013230 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1186\/1471-2105-10-137","volume":"10","author":"AJ Pinho","year":"2009","unstructured":"Pinho, A.J., Ferreira, P., Garcia, S.P.: On finding minimal absent words. BMC Bioinform. 10(1), 137 (2009)","journal-title":"BMC Bioinform."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Fukae, H., Ota, T., Morita, H.: On fast and memory-efficient construction of an antidictionary array. In: ISIT, pp. 1092\u20131096. IEEE (2012)","DOI":"10.1109\/ISIT.2012.6283021"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-32152-3_23","volume-title":"Parallel Processing and Applied Mathematics","author":"C Barton","year":"2016","unstructured":"Barton, C., Heliou, A., Mouchard, L., Pissis, S.P.: Parallelising the computation of minimal absent words. In: Wyrzykowski, R., Deelman, E., Dongarra, J., Karczewski, K., Kitowski, J., Wiatr, K. (eds.) PPAM 2015. LNCS, vol. 9574, pp. 243\u2013253. Springer, Cham (2016). doi:\n10.1007\/978-3-319-32152-3_23"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49529-2_25","volume-title":"LATIN 2016: Theoretical Informatics","author":"M Crochemore","year":"2016","unstructured":"Crochemore, M., Fici, G., Mercas, R., Pissis, S.P.: Linear-time sequence comparison using minimal absent words and applications. In: Kranakis, E., Navarro, G., Ch\u00e1vez, E. (eds.) LATIN 2016. LNCS, vol. 9644. Springer, Heidelberg (2016). doi:\n10.1007\/978-3-662-49529-2_25"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Ota, T., Morita, H.: On antidictionary coding based on compacted substring automaton. In: ISIT, pp. 1754\u20131758. IEEE (2013)","DOI":"10.1109\/ISIT.2013.6620528"},{"key":"5_CR14","unstructured":"Ota, T., Morita, H.: On a universal antidictionary coding for stationary ergodic sources with finite alphabet. In: ISITA, pp. 294\u2013298. IEEE (2014)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C.: Automata for matching patterns. In: Handbook of Formal Languages. Springer 399\u2013462(1997)","DOI":"10.1007\/978-3-662-07675-0_9"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-40450-4_12","volume-title":"Algorithms \u2013 ESA 2013","author":"D Belazzougui","year":"2013","unstructured":"Belazzougui, D., Cunial, F., K\u00e4rkk\u00e4inen, J., M\u00e4kinen, V.: Versatile succinct representations of the bidirectional Burrows-Wheeler transform. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 133\u2013144. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-40450-4_12"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66396-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T09:59:15Z","timestamp":1502704755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66396-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319663951","9783319663968"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66396-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}