{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:39Z","timestamp":1759637739509},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_53","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T03:22:47Z","timestamp":1376623367000},"page":"625-636","source":"Crossref","is-referenced-by-count":15,"title":["Efficient Indexes for Jumbled Pattern Matching with Constant-Sized Alphabet"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Kociumaka","sequence":"first","affiliation":[]},{"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"53_CR1","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1016\/j.dam.2009.11.010","volume":"158","author":"S.V. Avgustinovich","year":"2010","unstructured":"Avgustinovich, S.V., Glen, A., Halld\u00f3rsson, B.V., Kitaev, S.: On shortest crucial words avoiding Abelian powers. Discrete Applied Mathematics\u00a0158(6), 605\u2013607 (2010)","journal-title":"Discrete Applied Mathematics"},{"key":"53_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-13089-2_8","volume-title":"Language and Automata Theory and Applications","author":"F. Blanchet-Sadri","year":"2010","unstructured":"Blanchet-Sadri, F., Kim, J.I., Merca\u015f, R., Severa, W., Simmons, S.: Abelian square-free partial words. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 94\u2013105. Springer, Heidelberg (2010)"},{"key":"53_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-22321-1_7","volume-title":"Developments in Language Theory","author":"F. Blanchet-Sadri","year":"2011","unstructured":"Blanchet-Sadri, F., Simmons, S.: Avoiding Abelian powers in partial words. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 70\u201381. Springer, Heidelberg (2011)"},{"key":"53_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-13122-6_11","volume-title":"Fun with Algorithms","author":"P. Burcsi","year":"2010","unstructured":"Burcsi, P., Cicalese, F., Fici, G., Lipt\u00e1k, Z.: On table arrangements, scrabble freaks, and jumbled pattern matching. In: Boldi, P. (ed.) FUN 2010. LNCS, vol.\u00a06099, pp. 89\u2013101. Springer, Heidelberg (2010)"},{"issue":"2","key":"53_CR5","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1142\/S0129054112400175","volume":"23","author":"P. Burcsi","year":"2012","unstructured":"Burcsi, P., Cicalese, F., Fici, G., Lipt\u00e1k, Z.: Algorithms for jumbled pattern matching in strings. Int. J. Found. Comput. Sci.\u00a023(2), 357\u2013374 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"53_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s00224-011-9344-5","volume":"50","author":"P. Burcsi","year":"2012","unstructured":"Burcsi, P., Cicalese, F., Fici, G., Lipt\u00e1k, Z.: On approximate jumbled pattern matching in strings. Theory Comput. Syst.\u00a050(1), 35\u201351 (2012)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"53_CR7","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1142\/S0129054111008489","volume":"22","author":"J. Cassaigne","year":"2011","unstructured":"Cassaigne, J., Richomme, G., Saari, K., Zamboni, L.Q.: Avoiding Abelian powers in binary words with bounded Abelian complexity. Int. J. Found. Comput. Sci.\u00a022(4), 905\u2013920 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"53_CR8","unstructured":"Cicalese, F., Fici, G., Lipt\u00e1k, Z.: Searching for jumbled patterns in strings. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.) Proceedings of the Prague Stringology Conference 2009, Czech Technical University in Prague, Czech Republic, pp. 105\u2013117 (2009)"},{"key":"53_CR9","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 EATCS\u00a089, 167\u2013170 (2006)","journal-title":"Bulletin of the EATCS"},{"issue":"3","key":"53_CR10","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., 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. Information Processing Letters\u00a0113(3), 74\u201377 (2013)","journal-title":"Information Processing Letters"},{"issue":"1","key":"53_CR11","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.tcs.2008.09.027","volume":"410","author":"J.D. Currie","year":"2009","unstructured":"Currie, J.D., Aberkane, A.: A cyclic binary morphism avoiding Abelian fourth powers. Theor. Comput. Sci.\u00a0410(1), 44\u201352 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"53_CR12","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.tcs.2008.08.039","volume":"409","author":"J.D. Currie","year":"2008","unstructured":"Currie, J.D., Visentin, T.I.: Long binary patterns are Abelian 2-avoidable. Theor. Comput. Sci.\u00a0409(3), 432\u2013437 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"53_CR13","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.jcss.2010.07.003","volume":"77","author":"M.R. Fellows","year":"2011","unstructured":"Fellows, M.R., Fertin, G., Hermelin, D., Vialette, S.: Upper and lower bounds for finding connected motifs in vertex-colored graphs. J. Comput. Syst. Sci.\u00a077(4), 799\u2013811 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"53_CR14","unstructured":"Fici, G., Lecroq, T., Lefebvre, A., Prieur-Gaston, \u00c9.: Computing Abelian periods in words. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.) Proceedings of the Prague Stringology Conference 2011, Czech Technical University in Prague, Czech Republic, pp. 184\u2013196 (2011)"},{"key":"53_CR15","unstructured":"Fici, G., Lecroq, T., Lefebvre, A., Prieur-Gaston, E., Smyth, W.: Quasi-linear time computation of the abelian periods of a word. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.) Proceedings of the Prague Stringology Conference 2012, Czech Technical University in Prague, Czech Republic, pp. 103\u2013110 (2012)"},{"issue":"3","key":"53_CR16","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/828.1884","volume":"31","author":"M.L. Fredman","year":"1984","unstructured":"Fredman, M.L., Koml\u00f3s, J., Szemer\u00e9di, E.: Storing a sparse table with O(1) worst case access time. J. ACM\u00a031(3), 538\u2013544 (1984)","journal-title":"J. ACM"},{"key":"53_CR17","series-title":"LNCS","first-page":"517","volume-title":"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)"},{"key":"53_CR18","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W.: Fast algorithms for abelian periods in words and greatest common divisor queries. In: Portier, N., Wilke, T. (eds.) STACS. LIPIcs, vol.\u00a020, pp. 245\u2013256. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)"},{"issue":"4","key":"53_CR19","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1109\/TCBB.2006.55","volume":"3","author":"V. Lacroix","year":"2006","unstructured":"Lacroix, V., Fernandes, C.G., Sagot, M.-F.: Motif search in graphs: Application to metabolic networks. IEEE\/ACM Trans. Comput. Biology Bioinform.\u00a03(4), 360\u2013368 (2006)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"issue":"18-19","key":"53_CR20","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.ipl.2010.06.012","volume":"110","author":"T.M. Moosa","year":"2010","unstructured":"Moosa, T.M., Rahman, M.S.: Indexing permutations for binary strings. Inf. Process. Lett.\u00a0110(18-19), 795\u2013798 (2010)","journal-title":"Inf. Process. Lett."},{"key":"53_CR21","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.jda.2011.08.003","volume":"10","author":"T.M. Moosa","year":"2012","unstructured":"Moosa, T.M., Rahman, M.S.: Sub-quadratic time and linear space data structures for permutation matching in binary strings. J. Discrete Algorithms\u00a010, 5\u20139 (2012)","journal-title":"J. Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T10:08:09Z","timestamp":1548670089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}