{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:58Z","timestamp":1725491458086},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73208-2_12","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T07:58:11Z","timestamp":1189583891000},"page":"96-107","source":"Crossref","is-referenced-by-count":1,"title":["Two Element Unavoidable Sets of Partial Words"],"prefix":"10.1007","author":[{"given":"F.","family":"Blanchet-Sadri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. C.","family":"Brownstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Palumbo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string machines, an aid to bibliographic research. Comm. ACM\u00a018, 333\u2013340 (1975)","journal-title":"Comm. ACM"},{"key":"12_CR2","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. Theoret. Comput. Sci.\u00a0218, 135\u2013141 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.tcs.2004.08.011","volume":"329","author":"F. Blanchet-Sadri","year":"2004","unstructured":"Blanchet-Sadri, F.: Codes, orderings, and partial words. Theoret. Comput. Sci.\u00a0329, 177\u2013202 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR4","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 Appl. Math.\u00a0148, 195\u2013213 (2005)","journal-title":"Discrete Appl. Math."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.jcta.2004.09.002","volume":"109","author":"F. Blanchet-Sadri","year":"2005","unstructured":"Blanchet-Sadri, F., Duncan, S.: Partial Words and the Critical Factorization Theorem. J. Combin. Theory Ser. A\u00a0109, 221\u2013245 (2005), \n                    \n                      http:\/\/www.uncg.edu\/mat\/cft\/","journal-title":"J. Combin. Theory Ser. A"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0166-218X(84)90014-3","volume":"9","author":"C. Choffrut","year":"1984","unstructured":"Choffrut, C., Culik II, K.: On extendibility of unavoidable sets. Discrete Appl. Math.\u00a09, 125\u2013137 (1984)","journal-title":"Discrete Appl. Math."},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-642-59136-5_6","volume-title":"Handbook of Formal Languages","author":"C. Choffrut","year":"1997","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Combinatorics of Words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 329\u2013438. Springer, Heidelberg (1997)"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(82)90124-4","volume":"27","author":"A. Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht, A., Haussler, D., Rozenberg, G.: On regularity of context-free languages. Theoret. Comput. Sci.\u00a027, 311\u2013322 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/3-540-44676-1_14","volume-title":"Algorithms - ESA 2001","author":"R. Kolpakov","year":"2001","unstructured":"Kolpakov, R., Kucherov, G.: Finding Approximate Repetitions Under Hamming Distance. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 170\u2013181. Springer-Verlag, Heidelberg (2001)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(02)00448-6","volume":"33","author":"R. Kolpakov","year":"2003","unstructured":"Kolpakov, R., Kucherov, G.: Finding Approximate Repetitions Under Hamming Distance. Theoret. Comput. Sci.\u00a033, 135\u2013156 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/BFb0029801","volume-title":"Combinatorial Pattern Matching","author":"G. Landau","year":"1993","unstructured":"Landau, G., Schmidt, J.: An Algorithm for Approximate Tandem Repeats. In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds.) Combinatorial Pattern Matching. LNCS, vol.\u00a0684, pp. 120\u2013133. Springer-Verlag, Heidelberg (1993)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1089\/106652701300099038","volume":"8","author":"G.M. Landau","year":"2001","unstructured":"Landau, G.M., Schmidt, J.P., Sokol, D.: An Algorithm for Approximate Tandem Repeats. J. Comput. Biology\u00a08, 1\u201318 (2001)","journal-title":"J. Comput. Biology"},{"key":"12_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":"12_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(97)00031-5","volume":"201","author":"L. Rosaz","year":"1998","unstructured":"Rosaz, L.: Inventories of unavoidable languages and the word-extension conjecture. Theoret. Comput. Sci.\u00a0201, 151\u2013170 (1998)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1137\/S0097539795288489","volume":"27","author":"J.P. Schmidt","year":"1998","unstructured":"Schmidt, J.P.: All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings. SIAM J. Comput.\u00a027, 972\u2013992 (1998)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:05:31Z","timestamp":1619517931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540732075","9783540732082"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}