{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:14:54Z","timestamp":1762298094160},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319078892"},{"type":"electronic","value":"9783319078908"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07890-8_7","type":"book-chapter","created":{"date-parts":[[2014,5,28]],"date-time":"2014-05-28T16:08:51Z","timestamp":1401293331000},"page":"74-88","source":"Crossref","is-referenced-by-count":4,"title":["Normal, Abby Normal, Prefix Normal"],"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":"5-6","key":"7_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/S1570-8667(03)00035-2","volume":"1","author":"A. Amir","year":"2003","unstructured":"Amir, A., Apostolico, A., Landau, G.M., Satta, G.: Efficient text fingerprinting via Parikh mapping. J. Discrete Algorithms\u00a01(5-6), 409\u2013421 (2003)","journal-title":"J. Discrete Algorithms"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Badkobeh, G., Fici, G., Kroon, S., Lipt\u00e1k, Zs.: Binary jumbled string matching for highly run-length compressible texts. Inf. Process. Lett.\u00a0113(17), 604\u2013608 (2013)","DOI":"10.1016\/j.ipl.2013.05.007"},{"key":"7_CR3","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-540-39763-2_32","volume-title":"Algorithms in Bioinformatics","author":"G. Benson","year":"2003","unstructured":"Benson, G.: Composition alignment. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 447\u2013461. Springer, Heidelberg (2003)"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/bioinformatics\/btl291","volume":"23","author":"S. B\u00f6cker","year":"2007","unstructured":"B\u00f6cker, S.: Simulating multiplexed SNP discovery rates using base-specific cleavage and mass spectrometry. Bioinformatics\u00a023(2), 5\u201312 (2007)","journal-title":"Bioinformatics"},{"key":"7_CR5","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-78839-3_28","volume-title":"Research in Computational Molecular Biology","author":"S. B\u00f6cker","year":"2008","unstructured":"B\u00f6cker, S., Jahn, K., Mixtacki, J., Stoye, J.: Computation of median gene clusters. In: Vingron, M., Wong, L. (eds.) RECOMB 2008. LNCS (LNBI), vol.\u00a04955, pp. 331\u2013345. Springer, Heidelberg (2008)"},{"key":"7_CR6","unstructured":"Brooks, M., Wilder, G.: Young Frankenstein (1974), \n                  \n                    http:\/\/www.imdb.com\/title\/tt0072431\/quotes\n                  \n                  \n                , \n                  \n                    http:\/\/www.youtube.com\/watch?v=yH97lImrr0Q"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Burcsi, P., Cicalese, F., Fici, G., Lipt\u00e1k, Zs.: On table arrangements, scrabble freaks, and jumbled pattern matching. In: Boldi, P. (ed.) FUN 2010. LNCS, vol.\u00a06099, pp. 89\u2013101. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-13122-6_11"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Burcsi, P., Fici, G., Lipt\u00e1k, Zs., Ruskey, F., Sawada, J.: On combinatorial generation of prefix normal words. In: Kulikov, A. (ed.) CPM 2014. LNCS, vol.\u00a08486, pp. 60\u201369. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-319-07566-2_7"},{"issue":"6","key":"7_CR9","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_CR10","unstructured":"Cicalese, F., Fici, G., Lipt\u00e1k, Zs.: 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_CR11","doi-asserted-by":"crossref","unstructured":"Cicalese, F., Gagie, T., Giaquinta, E., Laber, E.S., Lipt\u00e1k, Zs., 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)","DOI":"10.1007\/978-3-319-02432-5_10"},{"key":"7_CR12","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_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-40453-5_5","volume-title":"Algorithms in Bioinformatics","author":"K. D\u00fchrkop","year":"2013","unstructured":"D\u00fchrkop, K., Ludwig, M., Meusel, M., B\u00f6cker, S.: Faster mass decomposition. In: Darling, A., Stoye, J. (eds.) WABI 2013. LNCS, vol.\u00a08126, pp. 45\u201358. Springer, Heidelberg (2013)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Fici, G., Lipt\u00e1k, Zs.: On prefix normal words. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 228\u2013238. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-22321-1_20"},{"key":"7_CR15","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)"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Giaquinta, E., Grabowski, Sz.: New algorithms for binary jumbled pattern matching. Inf. Process. Lett.\u00a0113(14-16), 538\u2013542 (2013)","DOI":"10.1016\/j.ipl.2013.04.013"},{"key":"7_CR17","unstructured":"Hermelin, D., Landau, G.M., Rabinovich, Y., Weimann, O.: Binary jumbled pattern matching via all-pairs shortest paths. Arxiv: 1401.2065v3 (2014)"},{"key":"7_CR18","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_CR19","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_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, 795\u2013798 (2010)","journal-title":"Inf. Process. Lett."},{"key":"7_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"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"J. Ian Munro","year":"1996","unstructured":"Ian Munro, J.: Tables. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol.\u00a01180, pp. 37\u201342. Springer, Heidelberg (1996)"},{"key":"7_CR23","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/11851561_35","volume-title":"Algorithms in Bioinformatics","author":"L. Parida","year":"2006","unstructured":"Parida, L.: Gapped permutation patterns for comparative genomics. In: B\u00fccher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol.\u00a04175, pp. 376\u2013387. Springer, Heidelberg (2006)"},{"issue":"1","key":"7_CR24","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_CR25","unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences, \n                  \n                    http:\/\/oeis.org\n                  \n                  \n                 Sequence A194850"},{"key":"7_CR26","unstructured":"Williams, A.M.: Shift Gray Codes. PhD thesis, University of Victoria, Canada (2009)"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07890-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:15:12Z","timestamp":1558912512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07890-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078892","9783319078908"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07890-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}