{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:47:52Z","timestamp":1775580472829,"version":"3.50.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319199283","type":"print"},{"value":"9783319199290","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19929-0_29","type":"book-chapter","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T13:09:49Z","timestamp":1434373789000},"page":"343-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On Maximal Unbordered Factors"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Loptev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Kucherov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatiana","family":"Starikovskaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"issue":"1","key":"29_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(79)90146-8","volume":"25","author":"R Assous","year":"1979","unstructured":"Assous, R., Pouzet, M.: Une caract\u00e9risation des mots p\u00e9riodiques. Discrete Math. 25(1), 1\u20135 (1979)","journal-title":"Discrete Math."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Cl\u00e9ment, J., Giambruno, L.: On the number of prefix and border tables. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 442\u2013453. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-642-54423-1_39"},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0012-365X(82)90186-8","volume":"40","author":"J-P Duval","year":"1982","unstructured":"Duval, J.-P.: Relationship between the period of a finite word and the length of its unbordered segments. Discrete Math. 40(1), 31\u201344 (1982)","journal-title":"Discrete Math."},{"issue":"1","key":"29_CR4","first-page":"51","volume":"10","author":"J-P Duval","year":"2005","unstructured":"Duval, J.-P., Lecroq, T., Lefebvre, A.: Border array on bounded alphabet. J. Autom. Lang. Comb. 10(1), 51\u201360 (2005)","journal-title":"J. Autom. Lang. Comb."},{"key":"29_CR5","unstructured":"Duval, J.-P., Lecroq, T., Lefebvre, A.: Efficient validation and construction of Knuth-Morris-Pratt arrays. In: Proceedings of Conference in Honor of Donald E. Knuth (2007)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.tcs.2013.12.008","volume":"522","author":"J-P Duval","year":"2014","unstructured":"Duval, J.-P., Lecroq, T., Lefebvre, A.: Linear computation of unbordered conjugate on unordered alphabet. Theor. Comp. Sci. 522, 77\u201384 (2014)","journal-title":"Theor. Comp. Sci."},{"issue":"2","key":"29_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0012-365X(79)90116-X","volume":"26","author":"A Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Silberger, D.M.: Periodicity and unbordered segments of words. Discrete Math. 26(2), 101\u2013109 (1979)","journal-title":"Discrete Math."},{"key":"29_CR8","first-page":"223","volume":"42","author":"F Fran\u0115k","year":"2000","unstructured":"Fran\u0115k, F., Gao, S., Lu, W., Ryan, P.J., Smyth, W.F., Sun, Y., Yang, L.: Verifying a border array in linear time. J. Comb. Math. Comb. Comput. 42, 223\u2013236 (2000)","journal-title":"J. Comb. Math. Comb. Comput."},{"issue":"2","key":"29_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s00224-013-9522-8","volume":"54","author":"P Gawrychowski","year":"2014","unstructured":"Gawrychowski, P., Je\u017c, A., Je\u017c, \u0141.: Validating the Knuth-Morris-Pratt failure function, fast and online. Theor. Comp. Sys. 54(2), 337\u2013372 (2014)","journal-title":"Theor. Comp. Sys."},{"issue":"3","key":"29_CR10","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/j.jcta.2011.11.004","volume":"119","author":"S Holub","year":"2012","unstructured":"Holub, S., Nowotka, D.: The Ehrenfeucht-Silberger problem. J. Comb. Theor., Ser. A 119(3), 668\u2013682 (2012)","journal-title":"J. Comb. Theor., Ser. A"},{"issue":"4","key":"29_CR11","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.jda.2010.08.004","volume":"8","author":"L Ilie","year":"2010","unstructured":"Ilie, L., Navarro, G., Tinta, L.: The longest common extension problem revisited and applications to approximate string searching. J. Discrete Algorithms 8(4), 418\u2013428 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-34109-0_30","volume-title":"String Processing and Information Retrieval","author":"T Kociumaka","year":"2012","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Efficient data structures for the factor periodicity problem. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 284\u2013294. Springer, Heidelberg (2012)"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Internal pattern matching queries in a text and applications. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 532\u2013551 (2014)","DOI":"10.1137\/1.9781611973730.36"},{"issue":"1","key":"29_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00009247","volume":"23","author":"D Moore","year":"1999","unstructured":"Moore, D., Smyth, W.F., Miller, D.: Counting distinct strings. Algorithmica 23(1), 1\u201313 (1999)","journal-title":"Algorithmica"},{"key":"29_CR15","unstructured":"Morris Jr., J.H., Pratt, V.R.: A linear pattern-matching algorithm, report 40. Technical report, University of California, Berkeley (1970)"},{"issue":"5","key":"29_CR16","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/TIT.1973.1055065","volume":"19","author":"P Nielsen","year":"1973","unstructured":"Nielsen, P.: A note on bifix-free sequences. IEEE Trans. Inf. Theor. 19(5), 704\u2013706 (1973)","journal-title":"IEEE Trans. Inf. Theor."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19929-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T09:20:34Z","timestamp":1674206434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19929-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319199283","9783319199290"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19929-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}