{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:15:11Z","timestamp":1762298111261},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075655"},{"type":"electronic","value":"9783319075662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07566-2_7","type":"book-chapter","created":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T03:50:31Z","timestamp":1402545031000},"page":"60-69","source":"Crossref","is-referenced-by-count":6,"title":["On Combinatorial Generation of Prefix Normal Words"],"prefix":"10.1007","author":[{"given":"P\u00e9ter","family":"Burcsi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriele","family":"Fici","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsuzsanna","family":"Lipt\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Ruskey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Sawada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"17","key":"7_CR1","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1016\/j.ipl.2013.05.007","volume":"113","author":"G. Badkobeh","year":"2013","unstructured":"Badkobeh, G., Fici, G., Kroon, S., Lipt\u00e1k, Z.: Binary jumbled string matching for highly run-length compressible texts. Inf. Process. Lett.\u00a0113(17), 604\u2013608 (2013)","journal-title":"Inf. Process. Lett."},{"key":"7_CR2","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":"1","key":"7_CR3","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":"6","key":"7_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.ipl.2004.09.002","volume":"92","author":"A. Butman","year":"2004","unstructured":"Butman, A., Eres, R., Landau, G.M.: Scaled and permuted string matching. Inf. Process. Lett.\u00a092(6), 293\u2013297 (2004)","journal-title":"Inf. Process. Lett."},{"key":"7_CR5","unstructured":"Cicalese, F., Fici, G., Lipt\u00e1k, Z.: Searching for jumbled patterns in strings. In: Proc. of the Prague Stringology Conference 2009 (PSC 2009), pp. 105\u2013117. Czech Technical University in Prague (2009)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-02432-5_10","volume-title":"String Processing and Information Retrieval","author":"F. Cicalese","year":"2013","unstructured":"Cicalese, F., Gagie, T., Giaquinta, E., Laber, E.S., Lipt\u00e1k, Z., Rizzi, R., Tomescu, A.I.: Indexes for jumbled pattern matching in strings, trees and graphs. In: Kurland, O., Lewenstein, M., Porat, E. (eds.) SPIRE 2013. LNCS, vol.\u00a08214, pp. 56\u201363. Springer, Heidelberg (2013)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-31265-6_12","volume-title":"Combinatorial Pattern Matching","author":"F. Cicalese","year":"2012","unstructured":"Cicalese, F., Laber, E.S., Weimann, O., Yuster, R.: Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol.\u00a07354, pp. 149\u2013158. Springer, Heidelberg (2012)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-22321-1_20","volume-title":"Developments in Language Theory","author":"G. Fici","year":"2011","unstructured":"Fici, G., Lipt\u00e1k, Z.: On prefix normal words. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 228\u2013238. Springer, Heidelberg (2011)"},{"key":"7_CR9","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)"},{"issue":"14-16","key":"7_CR10","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/j.ipl.2013.04.013","volume":"113","author":"E. Giaquinta","year":"2013","unstructured":"Giaquinta, E., Grabowski, S.: New algorithms for binary jumbled pattern matching. Inf. Process. Lett.\u00a0113(14-16), 538\u2013542 (2013)","journal-title":"Inf. Process. Lett."},{"key":"7_CR11","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":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-34109-0_35","volume-title":"String Processing and Information Retrieval","author":"L.-K. Lee","year":"2012","unstructured":"Lee, L.-K., Lewenstein, M., Zhang, Q.: Parikh matching in the streaming model. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol.\u00a07608, pp. 336\u2013341. Springer, Heidelberg (2012)"},{"key":"7_CR13","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, 795\u2013798 (2010)","journal-title":"Inf. Process. Lett."},{"key":"7_CR14","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 Alg.\u00a010, 5\u20139 (2012)","journal-title":"J. Discrete Alg."},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.jcta.2011.07.005","volume":"119","author":"F. Ruskey","year":"2012","unstructured":"Ruskey, F., Sawada, J., Williams, A.: Binary bubble languages and cool-lex order. J. Comb. Theory, Ser. A\u00a0119(1), 155\u2013169 (2012)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Ruskey, F., Sawada, J., Williams, A.: De Bruijn sequences for fixed-weight binary strings. SIAM Journal of Discrete Mathematics 26(2), 605\u2013517 (2012)","DOI":"10.1137\/100808782"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Sawada, J., Williams, A.: Efficient oracles for generating binary bubble languages. Electr. J. Comb. 19(1), P42 (2012)","DOI":"10.37236\/2051"},{"key":"7_CR18","unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences. Sequence A194850, Available electronically at http:\/\/oeis.org"},{"key":"7_CR19","unstructured":"Williams, A.M.: Shift Gray Codes. PhD thesis, Univ. of Victoria, Canada (2009)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07566-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T22:37:06Z","timestamp":1597963026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}