{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:06Z","timestamp":1759639086512,"version":"3.40.4"},"publisher-location":"Cham","reference-count":23,"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_8","type":"book-chapter","created":{"date-parts":[[2014,6,12]],"date-time":"2014-06-12T03:50:31Z","timestamp":1402545031000},"page":"70-78","source":"Crossref","is-referenced-by-count":0,"title":["Permuted Scaled Matching"],"prefix":"10.1007","author":[{"given":"Ayelet","family":"Butman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noa","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Ian","family":"Munro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Amir, A., Apostolico, A., Landau, G.M., Satta, G.: Efficient text fingerprinting via parikh mapping. J. Discrete Algorithms\u00a01(5-6) (2003)","DOI":"10.1016\/S1570-8667(03)00035-2"},{"issue":"4","key":"8_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0020-0190(99)00060-5","volume":"70","author":"A. Amir","year":"1999","unstructured":"Amir, A., Butman, A., Lewenstein, M.: Real scaled matching. Inf. Process. Lett.\u00a070(4), 185\u2013190 (1999)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/s00453-007-9021-x","volume":"53","author":"A. Amir","year":"2009","unstructured":"Amir, A., Butman, A., Lewenstein, M., Porat, E.: Real two dimensional scaled matching. Algorithmica\u00a053(3), 314\u2013336 (2009)","journal-title":"Algorithmica"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.jda.2006.03.017","volume":"5","author":"A. Amir","year":"2007","unstructured":"Amir, A., Butman, A., Lewenstein, M., Porat, E., Tsur, D.: Efficient one-dimensional real scaled matching. J. Discrete Algorithms\u00a05(2), 205\u2013211 (2007)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1006\/jagm.2000.1081","volume":"36","author":"A. Amir","year":"2000","unstructured":"Amir, A., C\u0103linescu, G.: Alphabet-independent and scaled dictionary matching. J. Algorithms\u00a036(1), 34\u201362 (2000)","journal-title":"J. Algorithms"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/s00453-008-9173-3","volume":"56","author":"A. Amir","year":"2010","unstructured":"Amir, A., Chencinski, E.: Faster two dimensional scaled matching. Algorithmica\u00a056(2), 214\u2013234 (2010)","journal-title":"Algorithmica"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/0196-6774(92)90003-U","volume":"13","author":"A. Amir","year":"1992","unstructured":"Amir, A., Landau, G.M., Vishkin, U.: Efficient pattern matching with scaling. J. Algorithms\u00a013(1), 2\u201332 (1992)","journal-title":"J. Algorithms"},{"issue":"10","key":"8_CR8","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Strother Moore, J.: A fast string searching algorithm. Commun. ACM\u00a020(10), 762\u2013772 (1977)","journal-title":"Commun. ACM"},{"issue":"2","key":"8_CR9","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":"8_CR10","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":"8_CR11","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":"8_CR12","unstructured":"Cicalese, F., Fici, G., Lipt\u00e1k, Z.: Searching for jumbled patterns in strings. In: Stringology, pp. 105\u2013117 (2009)"},{"key":"8_CR13","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., 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":"8_CR14","unstructured":"Fisher, M.J., Paterson, M.S.: String matching and other products. In: Karp, R.M. (ed.) Complexity of Computation. SIAM AMS Proceeding, vol.\u00a07, pp. 113\u2013125 (1974)"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/0022-0000(83)90002-8","volume":"26","author":"Z. Galil","year":"1983","unstructured":"Galil, Z., Seiferas, J.I.: Time-space-optimal string matching. J. Comput. Syst. Sci.\u00a026(3), 280\u2013294 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Sathishkumar, G.A., Ramachandran, S., Bhoopathy Bagan, K.: Image encryption using random pixel permutation by chaotic mapping. In: IEEE Symposium on Computers and Informatics (ISCI), pp. 247\u2013251 (2012)","DOI":"10.1109\/ISCI.2012.6222703"},{"issue":"12","key":"8_CR17","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1002\/(SICI)1097-024X(199612)26:12<1439::AID-SPE71>3.0.CO;2-1","volume":"26","author":"P. Jokinen","year":"1996","unstructured":"Jokinen, P., Tarhio, J., Ukkonen, E.: A comparison of approximate string matching algorithms. Softw., Pract. Exper.\u00a026(12), 1439\u20131458 (1996)","journal-title":"Softw., Pract. Exper."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Miller, R.E., Rosenberg, A.L.: Rapid identification of repeated patterns in strings, trees and arrays. In: STOC, pp. 125\u2013136 (1972)","DOI":"10.1145\/800152.804905"},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R.M. Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development\u00a031(2), 249\u2013260 (1987)","journal-title":"IBM Journal of Research and Development"},{"issue":"2","key":"8_CR20","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.B.: Fast Pattern Matching in Strings. SIAM Journal on Computing\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"8_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., Sohel Rahman, M.: 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":"8_CR22","doi-asserted-by":"crossref","unstructured":"Patidar, V., Purohit, G., Sud, K.K., Pareek, N.K.: Image encryption through a novel permutation-substitution scheme based on chaotic standard map. In: International Workshop on Chaos-Fractals Theories and Applications (IWCFTA), pp. 164\u2013169 (2010)","DOI":"10.1109\/IWCFTA.2010.58"},{"issue":"1","key":"8_CR23","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1137\/0220002","volume":"20","author":"U. Vishkin","year":"1991","unstructured":"Vishkin, U.: Deterministic sampling - a new technique for fast pattern matching. SIAM J. Comput.\u00a020(1), 22\u201340 (1991)","journal-title":"SIAM J. Comput."}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:38:47Z","timestamp":1746265127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07566-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075655","9783319075662"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07566-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}