{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:27:33Z","timestamp":1725467253233},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389047"},{"type":"electronic","value":"9783642389054"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38905-4_5","type":"book-chapter","created":{"date-parts":[[2013,5,16]],"date-time":"2013-05-16T03:28:54Z","timestamp":1368674934000},"page":"28-37","source":"Crossref","is-referenced-by-count":2,"title":["On Minimal and Maximal Suffixes of a Substring"],"prefix":"10.1007","author":[{"given":"Maxim","family":"Babenko","sequence":"first","affiliation":[]},{"given":"Ignat","family":"Kolesnichenko","sequence":"additional","affiliation":[]},{"given":"Tatiana","family":"Starikovskaya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","volume-title":"The design and analysis of computer algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Ullman, J.D., Hopcroft, J.E.: The design and analysis of computer algorithms. Addison-Wesley, Reading (1974)"},{"key":"5_CR2","first-page":"89","volume":"28","author":"A. Apostolico","year":"1995","unstructured":"Apostolico, A., Crochemore, M.: Fast parallel Lyndon factorization with applications. Theory of Computing Systems\u00a028, 89\u2013108 (1995), 10.1007\/BF01191471","journal-title":"Theory of Computing Systems"},{"key":"5_CR3","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":"M.A. Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Panario, D., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 88\u201394. Springer, Heidelberg (2000)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-16321-0_27","volume-title":"String Processing and Information Retrieval","author":"M. Crochemore","year":"2010","unstructured":"Crochemore, M., Iliopoulos, C., Kubica, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: Extracting powers and periods in a string from its runs structure. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol.\u00a06393, pp. 258\u2013269. Springer, Heidelberg (2010)"},{"key":"5_CR5","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press (1994)"},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"J.-P. Duval","year":"1983","unstructured":"Duval, J.-P.: Factorizing words over an ordered alphabet. J. Algorithms\u00a04(4), 363\u2013381 (1983)","journal-title":"J. Algorithms"},{"key":"5_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York (1997)"},{"key":"5_CR8","first-page":"237","volume":"12","author":"J. Karhum\u00e4ki","year":"2010","unstructured":"Karhum\u00e4ki, J., Lifshits, Y., Rytter, W.: Tiling Periodicity. Discrete Mathematics & Theoretical Computer Science\u00a012, 237\u2013248 (2010)","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Combinatorial Pattern Matching","author":"T. Kasai","year":"2001","unstructured":"Kasai, T., Lee, G., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 181\u2013192. Springer, Heidelberg (2001)"},{"key":"5_CR10","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.\u00a07608, pp. 284\u2013294. Springer, Heidelberg (2012)"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1242471.1242472","volume":"39","author":"S.J. Puglisi","year":"2007","unstructured":"Puglisi, S.J., Smyth, W.F., Turpin, A.H.: A taxonomy of suffix array construction algorithms. ACM Comput. Surv.\u00a039(2), 4 (2007)","journal-title":"ACM Comput. Surv."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38905-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T02:02:09Z","timestamp":1557712929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38905-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389047","9783642389054"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38905-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}