{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:20:39Z","timestamp":1761708039840},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403111"},{"type":"electronic","value":"9783540448884"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44888-8_16","type":"book-chapter","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T16:34:12Z","timestamp":1173112452000},"page":"211-224","source":"Crossref","is-referenced-by-count":7,"title":["Tuning String Matching for Huge Pattern Sets"],"prefix":"10.1007","author":[{"given":"Jari","family":"Kyt\u00f6joki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leena","family":"Salmela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorma","family":"Tarhio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"issue":"6","key":"16_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. Aho","year":"1975","unstructured":"A. Aho, M. Corasick: Efficient string matching: An aid to bibliographic search. Communications of the ACM 18,6 (1975), 333\u2013340.","journal-title":"Communications of the ACM"},{"issue":"3","key":"16_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1002\/spe.4380190305","volume":"19","author":"R. Baeza-Yates","year":"1989","unstructured":"R. Baeza-Yates. Improved string searching. Software \u2014 Practice and Experience, 19,3 (1989), 257\u2013271.","journal-title":"Software \u2014 Practice and Experience"},{"issue":"10","key":"16_CR3","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R. Baeza-Yates","year":"1992","unstructured":"R. Baeza-Yates, G. Gonnet: A new approach to text searching. Communications of ACM 35,10 (1992), 74\u201382.","journal-title":"Communications of ACM"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R. Boyer","year":"1977","unstructured":"R. Boyer, S. Moore: A fast string searching algorithm. Communications of the ACM 20 (1977), 762\u2013772.","journal-title":"Communications of the ACM"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/3-540-09510-1_10","volume":"71","author":"B. Commentz-Walter","year":"1979","unstructured":"B. Commentz-Walter: A string matching algorithm fast on the average. Proc. 6th International Colloquium on Automata, Languages and Programming, Lecture Notes on Computer Science 71, 1979, 118\u2013132.","journal-title":"Proc. 6th International Colloquium on Automata, Languages and Programming"},{"key":"16_CR6","unstructured":"M. Crochemore, W. Rytter: Text algorithms. Oxford University Press, 1994."},{"key":"16_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-45735-6_5","volume-title":"Proc. SPIRE\u2019 02, String Processing and Information Retrieval","author":"K. Fredriksson","year":"2002","unstructured":"K. Fredriksson: Fast string matching with super-alphabet. Proc. SPIRE\u2019 02, String Processing and Information Retrieval, Lecture Notes in Computer Science 2476, 2002, 44\u201357."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"M. Fisk, G. Varghese: Fast content-based packet handling for intrusion detection. UCSD Technical Report CS2001-0670, 2001.","DOI":"10.21236\/ADA406413"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"B. Gum, R. Lipton: Cheaper by the dozen: batched algorithms. Proc. First SIAM International Conference on Data Mining, 2001","DOI":"10.1137\/1.9781611972719.23"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"N. Horspool","year":"1980","unstructured":"N. Horspool: Practical fast searching in strings. Software \u2014 Practice and Experience 10 (1980), 501\u2013506.","journal-title":"Software \u2014 Practice and Experience"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R. Karp","year":"1987","unstructured":"R. Karp, M. Rabin: Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development 31 (1987), 249\u2013260.","journal-title":"IBM Journal of Research and Development"},{"key":"16_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/3-540-61258-0_7","volume-title":"Proc. CPM\u2019 96, Combinatorial Pattern Matching","author":"R. Muth","year":"1996","unstructured":"R. Muth, U. Manber: Approximate multiple string search. Proc. CPM\u2019 96, Combinatorial Pattern Matching, Lecture Notes in Computer Science 1075, 1996, 75\u201386."},{"issue":"4","key":"16_CR13","first-page":"1","volume":"5","author":"G. Navarro","year":"2000","unstructured":"G. Navarro, M. Raffinot: Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithms 5,4 (2000), 1\u201336.","journal-title":"ACM Journal of Experimental Algorithms"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"G. Navarro, M. Raffinot: Flexible pattern matching in strings. Cambridge University Press, 2002.","DOI":"10.1017\/CBO9781316135228"},{"key":"16_CR15","unstructured":"S. Wu, U. Manber: A fast algorithm for multi-pattern searching. Report TR-94-17, Department of Computer Science, University of Arizona, 1994."},{"key":"16_CR16","unstructured":"S. Wu, U. Manber: Agrep \u2014 A fast approximate pattern-matching tool. Proc. Usenix Winter 1992 Technical Conference, 1992, 153\u2013162."},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1145\/66451.66459","volume":"32","author":"R. Zhu","year":"1989","unstructured":"R. Zhu, T. Takaoka: A technique for two-dimensional pattern matching. Communications of the ACM 32 (1989), 1110\u20131120.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44888-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T05:40:42Z","timestamp":1556170842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44888-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403111","9783540448884"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44888-8_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}