{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T19:21:11Z","timestamp":1777317671337,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T00:00:00Z","timestamp":1307750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s00224-011-9344-5","type":"journal-article","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T16:14:15Z","timestamp":1307722455000},"page":"35-51","source":"Crossref","is-referenced-by-count":39,"title":["On Approximate Jumbled Pattern Matching in Strings"],"prefix":"10.1007","volume":"50","author":[{"given":"P\u00e9ter","family":"Burcsi","sequence":"first","affiliation":[]},{"given":"Ferdinando","family":"Cicalese","sequence":"additional","affiliation":[]},{"given":"Gabriele","family":"Fici","sequence":"additional","affiliation":[]},{"given":"Zsuzsanna","family":"Lipt\u00e1k","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,11]]},"reference":[{"issue":"5\u20136","key":"9344_CR1","doi-asserted-by":"crossref","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 1(5\u20136), 409\u2013421 (2003)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"9344_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1644015.1644035","volume":"6","author":"L. Babai","year":"2009","unstructured":"Babai, L., Felzenszwalb, P.F.: Computing rank-convolutions with a mask. ACM Trans. Algorithms 6(1), 1\u201313 (2009)","journal-title":"ACM Trans. Algorithms"},{"key":"9344_CR3","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/978-3-540-39763-2_32","volume-title":"Proc. of the 3rd International Workshop on Algorithms in Bioinformatics (WABI\u201903)","author":"G. Benson","year":"2003","unstructured":"Benson, G.: Composition alignment. In: Proc. of the 3rd International Workshop on Algorithms in Bioinformatics (WABI\u201903), pp. 447\u2013461 (2003)"},{"issue":"2","key":"9344_CR4","doi-asserted-by":"crossref","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 23(2), 5\u201312 (2007)","journal-title":"Bioinformatics"},{"issue":"8","key":"9344_CR5","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1089\/cmb.2009.0098","volume":"16","author":"S. B\u00f6cker","year":"2009","unstructured":"B\u00f6cker, S., Jahn, K., Mixtacki, J., Stoye, J.: Computation of median gene clusters. J. Comput. Biol. 16(8), 1085\u20131099 (2009)","journal-title":"J. Comput. Biol."},{"issue":"4","key":"9344_CR6","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s00453-007-0162-8","volume":"48","author":"S. B\u00f6cker","year":"2007","unstructured":"B\u00f6cker, S., Lipt\u00e1k, Zs.: A fast and simple algorithm for the money changing problem. Algorithmica 48(4), 413\u2013432 (2007)","journal-title":"Algorithmica"},{"key":"9344_CR7","first-page":"160","volume-title":"14th Annual European Symposium on Algorithms (ESA\u201906)","author":"D. Bremner","year":"2006","unstructured":"Bremner, D., Chan, T.M., Demaine, E.D., Erickson, J., Hurtado, F., Iacono, J., Langerman, S., Taslakian, P.: Necklaces, convolutions, and X+Y. In: 14th Annual European Symposium on Algorithms (ESA\u201906), pp. 160\u2013171 (2006)"},{"key":"9344_CR8","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/978-3-642-13122-6_11","volume-title":"5th International Conference FUN with Algorithms (FUN)","author":"P. Burcsi","year":"2010","unstructured":"Burcsi, P., Cicalese, F., Fici, G., Lipt\u00e1k, Zs.: Algorithms for jumbled pattern matching in strings. In: 5th International Conference FUN with Algorithms (FUN), pp. 89\u2013101 (2010)"},{"key":"9344_CR9","doi-asserted-by":"crossref","unstructured":"Burcsi, P., Cicalese, F., Fici, G., Lipt\u00e1k, Zs.: Algorithms for jumbled pattern matching in strings. Int. J. Found. Comput. Sci. (2011, to appear)","DOI":"10.1007\/s00224-011-9344-5"},{"issue":"6","key":"9344_CR10","doi-asserted-by":"crossref","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. 92(6), 293\u2013297 (2004)","journal-title":"Inf. Process. Lett."},{"key":"9344_CR11","first-page":"105","volume-title":"Proc. of the Prague Stringology Conference 2009 (PSC\u201909)","author":"F. Cicalese","year":"2009","unstructured":"Cicalese, F., Fici, G., Lipt\u00e1k, Zs.: Searching for jumbled patterns in strings. In: Proc. of the Prague Stringology Conference 2009 (PSC\u201909), pp. 105\u2013117 (2009)"},{"issue":"1","key":"9344_CR12","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0166-218X(03)00187-2","volume":"137","author":"M. Cieliebak","year":"2004","unstructured":"Cieliebak, M., Erlebach, T., Lipt\u00e1k, Zs., Stoye, J., Welzl, E.: Algorithmic complexity of protein identification: combinatorics of weighted strings. Discrete Appl. Math. 137(1), 27\u201346 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9344_CR13","unstructured":"Clark, D.: Compact pat trees. Ph.D. thesis, University of Waterloo, Canada (1996)"},{"issue":"6","key":"9344_CR14","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1089\/cmb.2004.11.1050","volume":"11","author":"R. Eres","year":"2004","unstructured":"Eres, R., Landau, G.M., Parida, L.: Permutation pattern discovery in biosequences. J. Comput. Biol. 11(6), 1050\u20131060 (2004)","journal-title":"J. Comput. Biol."},{"key":"9344_CR15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF00049168","volume":"5","author":"K. Goczy\u0142a","year":"1986","unstructured":"Goczy\u0142a, K.: The generalized Banach match-box problem: application in disc storage management. Acta Appl. Math. 5, 27\u201336 (1986)","journal-title":"Acta Appl. Math."},{"key":"9344_CR16","first-page":"841","volume-title":"Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201903)","author":"R. Grossi","year":"2003","unstructured":"Grossi, R., Gupta, A., Vitter, J.S.: High-order entropy-compressed text indexes. In: Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201903), pp. 841\u2013850 (2003)"},{"issue":"12","key":"9344_CR17","doi-asserted-by":"crossref","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. Exp. 26(12), 1439\u20131458 (1996)","journal-title":"Softw. Pract. Exp."},{"issue":"2","key":"9344_CR18","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Jr., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"9344_CR19","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/359060.359077","volume":"22","author":"H. Mendelson","year":"1979","unstructured":"Mendelson, H., Pliskin, J., Yechiali, U.: Optimal storage allocation for serial files. Commun. ACM 22, 124\u2013130 (1979)","journal-title":"Commun. ACM"},{"key":"9344_CR20","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1287\/opre.28.3.687","volume":"28","author":"H. Mendelson","year":"1980","unstructured":"Mendelson, H., Pliskin, J., Yechiali, U.: A stochastic allocation problem. Oper. Res. 28, 687\u2013693 (1980)","journal-title":"Oper. Res."},{"key":"9344_CR21","doi-asserted-by":"crossref","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. 110, 795\u2013798 (2010)","journal-title":"Inf. Process. Lett."},{"key":"9344_CR22","doi-asserted-by":"crossref","unstructured":"Moosa, T.M., Rahman, M.S.: Sub-quadratic time and linear size data structures for permutation matching in binary strings. J. Discrete Algorithms (2011, to appear)","DOI":"10.1016\/j.jda.2011.08.003"},{"key":"9344_CR23","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-62034-6_35","volume-title":"Proc. of Foundations of Software Technology and Theoretical Computer Science (FSTTCS\u201996)","author":"J.I. Munro","year":"1996","unstructured":"Munro, J.I.: Tables. In: Proc. of Foundations of Software Technology and Theoretical Computer Science (FSTTCS\u201996), pp. 37\u201342 (1996)"},{"key":"9344_CR24","doi-asserted-by":"crossref","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Comput. Surv. 39(1) (2007)","DOI":"10.1145\/1216370.1216372"},{"key":"9344_CR25","first-page":"376","volume-title":"Proc. of WABI 2006","author":"L. Parida","year":"2006","unstructured":"Parida, L.: Gapped permutation patterns for comparative genomics. In: Proc. of WABI 2006, pp. 376\u2013387 (2006)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9344-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9344-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9344-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T16:39:51Z","timestamp":1560271191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9344-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,11]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9344"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9344-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,11]]}}}