{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:56Z","timestamp":1759637576119,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319238258"},{"type":"electronic","value":"9783319238265"}],"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_10","type":"book-chapter","created":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T08:20:20Z","timestamp":1441354820000},"page":"95-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Algorithms for Longest Closed Factor Array"],"prefix":"10.1007","author":[{"given":"Hideo","family":"Bannai","sequence":"first","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Kociumaka","sequence":"additional","affiliation":[]},{"given":"Arnaud","family":"Lefebvre","sequence":"additional","affiliation":[]},{"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]},{"given":"Shiho","family":"Sugimoto","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Wale\u0144","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,5]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Babenko, M.A., Gawrychowski, P., Kociumaka, T., Starikovskaya, T.: Wavelet trees meet suffix trees. arXiv:1408.6182v4 (2015)","DOI":"10.1137\/1.9781611973730.39"},{"key":"10_CR2","unstructured":"Badkobeh, G., Bannai, H., Goto, K., Tomohiro, I., Iliopoulos, C.S., Inenaga, S., Puglisi, S.J., Sugimoto, S.: Closed factorization. In: Holub, J., \u017dd\u2019\u00e1rek, J. (eds.) Prague Stringology Conference 2014, pp. 162\u2013168 (2014)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/978-3-319-15579-1_29","volume-title":"Language and Automata Theory and Applications","author":"G Badkobeh","year":"2015","unstructured":"Badkobeh, G., Fici, G., Lipt\u00e1k, Z.: On the number of closed factors in a word. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 381\u2013390. Springer, Heidelberg (2015)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A Blumer","year":"1985","unstructured":"Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.I.: The smallest automaton recognizing the subwords of a text. Theor. Comput. Sci. 40, 31\u201355 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1137\/S0097539700370539","volume":"34","author":"R Cole","year":"2005","unstructured":"Cole, R., Hariharan, R.: Dynamic LCA queries on trees. SIAM J. Comput. 34(4), 894\u2013923 (2005)","journal-title":"SIAM J. Comput."},{"key":"10_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ejc.2012.07.011","volume":"34","author":"M Crochemore","year":"2013","unstructured":"Crochemore, M., Ilie, L., Iliopoulos, C.S., Kubica, M., Rytter, W., Wale\u0144, T.: Computing the longest previous factor. Eur. J. of Comb. 34(1), 15\u201326 (2013)","journal-title":"Eur. J. of Comb."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Fici, G.: A classification of trapezoidal words. In: Ambroz, P., Holub, S., Mas\u00e1kov\u00e1, Z. (eds.) Combinatorics on Words - WORDS 2011. EPTCS, vol. 63, pp. 129\u2013137 (2011)","DOI":"10.4204\/EPTCS.63.18"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-319-19929-0_14","volume-title":"Combinatorial Pattern Matching","author":"J Fischer","year":"2015","unstructured":"Fischer, J., Gawrychowski, P.: Alphabet-dependent string searching with wexponential search trees. In: Cicalese, F., Porat, E., Vaccaro, U. (eds.) CPM 2015. LNCS, vol. 9133, pp. 160\u2013171. Springer, Heidelberg (2015)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-40579-2_15","volume-title":"Combinatorics on Words","author":"A De Luca","year":"2013","unstructured":"De Luca, A., Fici, G.: Open and closed prefixes of Sturmian words. In: Karhum\u00e4ki, J., Lepist\u00f6, A., Zamboni, L. (eds.) WORDS 2013. LNCS, vol. 8079, pp. 132\u2013142. Springer, Heidelberg (2013)"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T11:33:00Z","timestamp":1676979180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23826-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319238258","9783319238265"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23826-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"5 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}