{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:34:28Z","timestamp":1725798868446},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319096971"},{"type":"electronic","value":"9783319096988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09698-8_16","type":"book-chapter","created":{"date-parts":[[2014,8,18]],"date-time":"2014-08-18T00:52:51Z","timestamp":1408323171000},"page":"178-190","source":"Crossref","is-referenced-by-count":3,"title":["k-Abelian Pattern Matching"],"prefix":"10.1007","author":[{"given":"Thorsten","family":"Ehlers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florin","family":"Manea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Merca\u015f","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Nowotka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-19391-0_7","volume-title":"Rainbow of Computer Science","author":"M. Huova","year":"2011","unstructured":"Huova, M., Karhum\u00e4ki, J., Saarela, A., Saari, K.: Local squares, periodicity and finite automata. In: Calude, C.S., Rozenberg, G., Salomaa, A. (eds.) Rainbow of Computer Science. LNCS, vol.\u00a06570, pp. 90\u2013101. Springer, Heidelberg (2011)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.tcs.2012.03.010","volume":"454","author":"M. Huova","year":"2012","unstructured":"Huova, M., Karhum\u00e4ki, J., Saarela, A.: Problems in between words and abelian words: k-abelian avoidability. Theor. Comput. Sci.\u00a0454, 172\u2013177 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-38771-5_33","volume-title":"Developments in Language Theory","author":"R. Merca\u015f","year":"2013","unstructured":"Merca\u015f, R., Saarela, A.: 3-abelian cubes are avoidable on binary alphabets. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol.\u00a07907, pp. 374\u2013383. Springer, Heidelberg (2013)"},{"key":"16_CR4","unstructured":"Rao, M.: On some generalizations of abelian power avoidability (2013) (preprint)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-31653-1_27","volume-title":"Developments in Language Theory","author":"J. Karhum\u00e4ki","year":"2012","unstructured":"Karhum\u00e4ki, J., Puzynina, S., Saarela, A.: Fine and Wilf\u2019s theorem for k-abelian periods. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol.\u00a07410, pp. 296\u2013307. Springer, Heidelberg (2012)"},{"issue":"8","key":"16_CR6","doi-asserted-by":"publisher","first-page":"2189","DOI":"10.1016\/j.jcta.2013.08.008","volume":"120","author":"J. Karhum\u00e4ki","year":"2013","unstructured":"Karhum\u00e4ki, J., Saarela, A., Zamboni, L.Q.: On a generalization of abelian equivalence and complexity of infinite words. J. Combin. Theory Ser. A\u00a0120(8), 2189\u20132206 (2013)","journal-title":"J. Combin. Theory Ser. A"},{"key":"16_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":"16_CR8","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J. K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. Journal of the ACM\u00a053, 918\u2013936 (2006)","journal-title":"Journal of the ACM"},{"key":"16_CR9","first-page":"33","volume":"24","author":"L.J. Cummings","year":"1997","unstructured":"Cummings, L.J., Smyth, W.F.: Weak repetitions in strings. J. Combin. Math. Combin. Comput.\u00a024, 33\u201348 (1997)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-70575-8_8","volume-title":"Automata, Languages and Programming","author":"M. Ru\u017ei\u0107","year":"2008","unstructured":"Ru\u017ei\u0107, M.: Constructing efficient dictionaries in close to sorting time. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 84\u201395. Springer, Heidelberg (2008)"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time. In: SFCS 16, pp. 75\u201384. IEEE Computer Society (1975)","DOI":"10.1109\/SFCS.1975.26"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-21458-5_16","volume-title":"Combinatorial Pattern Matching","author":"D. Breslauer","year":"2011","unstructured":"Breslauer, D., Grossi, R., Mignosi, F.: Simple real-time constant-space string matching. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 173\u2013183. Springer, Heidelberg (2011)"},{"issue":"6","key":"16_CR13","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.ipl.2005.12.012","volume":"101","author":"M.G. Maa\u00df","year":"2007","unstructured":"Maa\u00df, M.G.: Computing suffix links for suffix trees and arrays. Inf. Process. Lett.\u00a0101(6), 250\u2013254 (2007)","journal-title":"Inf. Process. Lett."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Gawrychowski, P., Lewenstein, M., Nicholson, P.K.: Weighted level ancestors in suffix trees (peprint, 2014)","DOI":"10.1007\/978-3-662-44777-2_38"},{"key":"16_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words","author":"M. Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press, Cambridge (2005)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-642-40450-4_53","volume-title":"Algorithms \u2013 ESA 2013","author":"T. Kociumaka","year":"2013","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W.: Efficient indexes for jumbled pattern matching with constant-sized alphabet. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol.\u00a08125, pp. 625\u2013636. Springer, Heidelberg (2013)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-642-40450-4_44","volume-title":"Algorithms \u2013 ESA 2013","author":"T. Gagie","year":"2013","unstructured":"Gagie, T., Hermelin, D., Landau, G.M., Weimann, O.: Binary jumbled pattern matching on trees and tree-like structures. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol.\u00a08125, pp. 517\u2013528. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09698-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T16:03:35Z","timestamp":1558973015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09698-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319096971","9783319096988"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09698-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}