{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:36:21Z","timestamp":1787510181868,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642341083","type":"print"},{"value":"9783642341090","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34109-0_35","type":"book-chapter","created":{"date-parts":[[2012,9,13]],"date-time":"2012-09-13T07:14:53Z","timestamp":1347520493000},"page":"336-341","source":"Crossref","is-referenced-by-count":6,"title":["Parikh Matching in the Streaming Model"],"prefix":"10.1007","author":[{"given":"Lap-Kei","family":"Lee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"5-6","key":"35_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":"35_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-21458-5_15","volume-title":"Combinatorial Pattern Matching","author":"D. Breslauer","year":"2011","unstructured":"Breslauer, D., Galil, Z.: Real-Time Streaming String-Matching. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol.\u00a06661, pp. 162\u2013172. Springer, Heidelberg (2011)"},{"issue":"1","key":"35_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., Liptak, Z.: On Approximate jumbled pattern matching in strings. Theory Comput. Syst.\u00a050(1), 35\u201351 (2012)","journal-title":"Theory Comput. Syst."},{"issue":"6","key":"35_CR4","doi-asserted-by":"publisher","first-page":"1794","DOI":"10.1137\/S0097539701398363","volume":"31","author":"M. Datar","year":"2002","unstructured":"Datar, M., Gionis, A., Indyk, P., Motwani, R.: Maintaining stream statistics over sliding windows. SIAM J. Comput.\u00a031(6), 1794\u20131813 (2002)","journal-title":"SIAM J. Comput."},{"key":"35_CR5","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-39763-2_2","volume-title":"Algorithms in Bioinformatics","author":"G. Didier","year":"2003","unstructured":"Didier, G.: Common Intervals of Two Sequences. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 17\u201324. Springer, Heidelberg (2003)"},{"issue":"2","key":"35_CR6","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.jda.2006.03.021","volume":"5","author":"G. Didier","year":"2007","unstructured":"Didier, G., Schmidt, T., Stoye, J., Tsur, D.: Character sets of strings. J. Discrete Algorithms\u00a05(2), 330\u2013340 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"35_CR7","unstructured":"Ejaz, T.: Abelian pattern matching in strings. Ph.D. Dissertation, Faculty of Informatics, Technical University of Dortmund (2010)"},{"issue":"6","key":"35_CR8","doi-asserted-by":"publisher","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. Journal of Computational Biology\u00a011(6), 1050\u20131060 (2004)","journal-title":"Journal of Computational Biology"},{"issue":"4","key":"35_CR9","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."},{"issue":"3","key":"35_CR10","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1145\/1147954.1147955","volume":"53","author":"P. Indyk","year":"2006","unstructured":"Indyk, P.: Stable distributions, pseudorandom generators, embeddings, and data stream computation. JACM\u00a053(3), 307\u2013323 (2006)","journal-title":"JACM"},{"issue":"12","key":"35_CR11","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."},{"issue":"2","key":"35_CR12","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"},{"key":"35_CR13","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: Proc. STOC, pp. 125\u2013136 (1972)","DOI":"10.1145\/800152.804905"},{"issue":"6","key":"35_CR14","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J. Karkkainen","year":"2006","unstructured":"Karkkainen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. JACM\u00a053(6), 918\u2013936 (2006)","journal-title":"JACM"},{"key":"35_CR15","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/11557067_15","volume-title":"Algorithms in Bioinformatics","author":"V. Lacroix","year":"2005","unstructured":"Lacroix, V., Fernandes, C.G., Sagot, M.-F.: Reaction Motifs in Metabolic Networks. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), vol.\u00a03692, pp. 178\u2013191. Springer, Heidelberg (2005)"},{"issue":"5","key":"35_CR16","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput.\u00a022(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511814075"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Porat, B., Porat, E.: Exact and approximate pattern matching in the streaming model. In: Proc. FOCS, pp. 315\u2013323 (2009)","DOI":"10.1109\/FOCS.2009.11"},{"key":"35_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-27801-6_26","volume-title":"Combinatorial Pattern Matching","author":"T. Schmidt","year":"2004","unstructured":"Schmidt, T., Stoye, J.: Quadratic Time Algorithms for Finding Common Intervals in Two and More Sequences. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 347\u2013358. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34109-0_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:45:15Z","timestamp":1620117915000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34109-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341083","9783642341090"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34109-0_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}