{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:47:49Z","timestamp":1775580469253,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319238258","type":"print"},{"value":"9783319238265","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-23826-5_24","type":"book-chapter","created":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T08:20:20Z","timestamp":1441354820000},"page":"246-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Computing the Longest Unbordered Substring"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Gawrychowski","sequence":"first","affiliation":[]},{"given":"Gregory","family":"Kucherov","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Sach","sequence":"additional","affiliation":[]},{"given":"Tatiana","family":"Starikovskaya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,5]]},"reference":[{"issue":"1","key":"24_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. Journal of Discrete Mathematics 25(1), 1\u20135 (1979)","journal-title":"Journal of Discrete Mathematics"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/3-540-45995-2_44","volume-title":"LATIN 2002: Theoretical Informatics","author":"MA Bender","year":"2002","unstructured":"Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 508\u2013515. Springer, Heidelberg (2002)"},{"issue":"1","key":"24_CR4","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. Journal of Discrete Mathematics 40(1), 31\u201344 (1982)","journal-title":"Journal of Discrete Mathematics"},{"key":"24_CR5","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. Journal of Theoretical Computer Science 522, 77\u201384 (2014)","journal-title":"Journal of Theoretical Computer Science"},{"issue":"2","key":"24_CR6","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. Journal of Discrete Mathematics 26(2), 101\u2013109 (1979)","journal-title":"Journal of Discrete Mathematics"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Farach-Colton, M.: Optimal suffix tree construction with large alphabets. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 137\u2013143. IEEE Computer Society (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Holub, S\u0306., Nowotka, D.: The Ehrenfeucht-Silberger problem. Journal of Combinatorial Theory, Series A 119(3), 668\u2013682 (2012)","DOI":"10.1016\/j.jcta.2011.11.004"},{"issue":"4","key":"24_CR9","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. Journal of Discrete Algorithms 8(4), 418\u2013428 (2010)","journal-title":"Journal of Discrete Algorithms"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Jacobson, G.: Space-efficient static trees and graphs. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pp. 549\u2013554 (October 1989)","DOI":"10.1109\/SFCS.1989.63533"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-319-19929-0_29","volume-title":"Combinatorial Pattern Matching","author":"A Loptev","year":"2015","unstructured":"Loptev, A., Kucherov, G., Starikovskaya, T.: On maximal unbordered factors. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 343\u2013354. Springer, Heidelberg (2015)"},{"key":"24_CR12","unstructured":"Morris, Jr., J.H., Pratt, V.R.: A linear pattern-matching algorithm, report 40. Technical report, University of California, Berkeley (1970)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Szpankowski, W.: Average Case Analysis of Algorithms on Sequences. John Wiley & Sons Inc. (2001)","DOI":"10.1002\/9781118032770"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Proceedings of the 14th Annual IEEE Symposium on Foundations of Computer Science, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23826-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T12:13:16Z","timestamp":1748607196000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23826-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319238258","9783319238265"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23826-5_24","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":"5 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}