{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:11:55Z","timestamp":1743005515153,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319788241"},{"type":"electronic","value":"9783319788258"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78825-8_34","type":"book-chapter","created":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T18:59:07Z","timestamp":1523905147000},"page":"420-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Abelian String Regularities Based on RLE"],"prefix":"10.1007","author":[{"given":"Shiho","family":"Sugimoto","sequence":"first","affiliation":[]},{"given":"Naoki","family":"Noda","sequence":"additional","affiliation":[]},{"given":"Shunsuke","family":"Inenaga","sequence":"additional","affiliation":[]},{"given":"Hideo","family":"Bannai","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,17]]},"reference":[{"issue":"5","key":"34_CR1","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1142\/S0129054116500143","volume":"27","author":"A Alatabbi","year":"2016","unstructured":"Alatabbi, A., Iliopoulos, C.S., Langiu, A., Rahman, M.S.: Algorithms for longest common Abelian factors. Int. J. Found. Comput. Sci. 27(5), 529\u2013544 (2016). http:\/\/dx.doi.org\/10.1142\/S0129054116500143","journal-title":"Int. J. Found. Comput. Sci."},{"key":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-11918-2_5","volume-title":"String Processing and Information Retrieval","author":"A Amir","year":"2014","unstructured":"Amir, A., Apostolico, A., Hirst, T., Landau, G.M., Lewenstein, N., Rozenberg, L.: Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings. In: Moura, E., Crochemore, M. (eds.) SPIRE 2014. LNCS, vol. 8799, pp. 45\u201351. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11918-2_5"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-319-46049-9_24","volume-title":"String Processing and Information Retrieval","author":"G Badkobeh","year":"2016","unstructured":"Badkobeh, G., Gagie, T., Grabowski, S., Nakashima, Y., Puglisi, S.J., Sugimoto, S.: Longest common Abelian factors and large alphabets. In: Inenaga, S., Sadakane, K., Sakai, T. (eds.) SPIRE 2016. LNCS, vol. 9954, pp. 254\u2013259. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46049-9_24"},{"key":"34_CR4","first-page":"167","volume":"89","author":"S Constantinescu","year":"2006","unstructured":"Constantinescu, S., Ilie, L.: Fine and Wilf\u2019s theorem for Abelian periods. Bull. EATCS 89, 167\u2013170 (2006)","journal-title":"Bull. EATCS"},{"issue":"3","key":"34_CR5","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.ipl.2012.11.001","volume":"113","author":"M Crochemore","year":"2013","unstructured":"Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Pachocki, J., Radoszewski, J., Rytter, W., Tyczy\u0144ski, W., Wale\u0144, T.: A note on efficient computation of all Abelian periods in a string. Inf. Process. Lett. 113(3), 74\u201377 (2013)","journal-title":"Inf. Process. Lett."},{"key":"34_CR6","first-page":"33","volume":"24","author":"LJ Cummings","year":"1997","unstructured":"Cummings, L.J., Smyth, W.F.: Weak repetitions in strings. J. Comb. Math. Comb. Comput. 24, 33\u201348 (1997)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"34_CR7","first-page":"221","volume":"6","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P.: Some unsolved problems. Hungarian Academy of Sciences Mat. Kutat\u00f3 Int\u00e9zet K\u00f6zl 6, 221\u2013254 (1961)","journal-title":"Hungarian Academy of Sciences Mat. Kutat\u00f3 Int\u00e9zet K\u00f6zl"},{"key":"34_CR8","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 Appl. Math. 163, 287\u2013297 (2014)","journal-title":"Discrete Appl. Math."},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.dam.2015.09.024","volume":"212","author":"G Fici","year":"2016","unstructured":"Fici, G., Lecroq, T., Lefebvre, A., Prieur-Gaston, \u00c9., Smyth, W.F.: A note on easy and efficient computation of full Abelian periods of a word. Discrete Appl. Math. 212, 88\u201395 (2016)","journal-title":"Discrete Appl. Math."},{"key":"34_CR10","unstructured":"Grabowski, S.: A note on the longest common Abelian factor problem. CoRR abs\/1503.01093 (2015)"},{"key":"34_CR11","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W.: Fast algorithms for Abelian periods in words and greatest common divisor queries. In: STACS 2013, pp. 245\u2013256 (2013)"},{"key":"34_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-319-32859-1_27","volume-title":"Mathematical Aspects of Computer and Information Sciences","author":"T Kociumaka","year":"2016","unstructured":"Kociumaka, T., Radoszewski, J., Wi\u015bniewski, B.: Subquadratic-time algorithms for Abelian stringology problems. In: Kotsireas, I.S., Rump, S.M., Yap, C.K. (eds.) MACIS 2015. LNCS, vol. 9582, pp. 320\u2013334. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32859-1_27"},{"key":"34_CR13","unstructured":"Sugimoto, S., Noda, N., Inenaga, S., Bannai, H., Takeda, M.: Computing Abelian regularities on RLE strings. CoRR abs\/1701.02836 (2017). http:\/\/arxiv.org\/abs\/1701.02836"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78825-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:09:55Z","timestamp":1709809795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78825-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319788241","9783319788258"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78825-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Newcastle","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/carma.newcastle.edu.au\/meetings\/iwoca\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}