{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:21:42Z","timestamp":1743045702656,"version":"3.40.3"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"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-15579-1_30","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"391-401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Computation of Abelian Runs"],"prefix":"10.1007","author":[{"given":"Gabriele","family":"Fici","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thierry","family":"Lecroq","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Lefebvre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9lise","family":"Prieur-Gaston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Bannai, H., I, T., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: A new characterization of maximal repetitions by Lyndon trees. CoRR abs\/1406.0263 (2014). http:\/\/arxiv.org\/abs\/1406.0263","DOI":"10.1137\/1.9781611973730.38"},{"key":"30_CR2","first-page":"167","volume":"89","author":"S Constantinescu","year":"2006","unstructured":"Constantinescu, S., Ilie, L.: Fine and Wilf\u2019s theorem for abelian periods. Bulletin of the European Association for Theoretical Computer Science 89, 167\u2013170 (2006)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"30_CR3","first-page":"33","volume":"24","author":"LJ Cummings","year":"1997","unstructured":"Cummings, L.J., Smyth, W.F.: Weak repetitions in strings. Journal of Combinatorial Mathematics and Combinatorial Computing 24, 33\u201348 (1997)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.dam.2013.08.021","volume":"163","author":"G Fici","year":"2014","unstructured":"Fici, G., Lecroq, T., Lefebvre, A., Prieur-Gaston, \u00c9.: Algorithms for computing abelian periods of words. Discrete Applied Mathematics 163, 287\u2013297 (2014)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR5","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proceedings of the 1999 Symposium on Foundations of Computer Science (FOCS 1999), 17\u201319 October 1999, pp. 596\u2013604. IEEE Computer Society, New York (1999)"},{"key":"30_CR6","unstructured":"Matsuda, S., Inenaga, S., Bannai, H., Takeda, M.: Computing abelian covers and abelian runs. In: Prague Stringology Conference 2014, p. 43 (2014)"},{"issue":"1","key":"30_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ejc.2012.07.010","volume":"34","author":"WF Smyth","year":"2013","unstructured":"Smyth, W.F.: Computing regularities in strings: a survey. European J. Combinatorics 34(1), 3\u201314 (2013)","journal-title":"European J. Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T04:14:39Z","timestamp":1676434479000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_30","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":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}