{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:33Z","timestamp":1759639053639},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642341083"},{"type":"electronic","value":"9783642341090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34109-0_23","type":"book-chapter","created":{"date-parts":[[2012,9,13]],"date-time":"2012-09-13T11:14:53Z","timestamp":1347534893000},"page":"217-228","source":"Crossref","is-referenced-by-count":10,"title":["Fast Multiple String Matching Using Streaming SIMD Extensions Technology"],"prefix":"10.1007","author":[{"given":"Simone","family":"Faro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. O\u011fuzhan","family":"K\u00fclekci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"23_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"issue":"10","key":"23_CR2","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R., Gonnet, G.H.: A new approach to text searching. Communications of the ACM\u00a035(10), 74\u201382 (1992)","journal-title":"Communications of the ACM"},{"key":"23_CR3","unstructured":"Ben-Kiki, O., Bille, P., Breslauer, D., Gasieniec, L., Grossi, R., Weimann, O.: Optimal packed string matching. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), vol.\u00a013, pp. 423\u2013432 (2011)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-13509-5_26","volume-title":"Combinatorial Pattern Matching","author":"D. Cantone","year":"2010","unstructured":"Cantone, D., Faro, S., Giaquinta, E.: A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol.\u00a06129, pp. 288\u2013298. Springer, Heidelberg (2010)"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.jda.2011.02.001","volume":"11","author":"D. Cantone","year":"2012","unstructured":"Cantone, D., Faro, S., Giaquinta, E.: On the bit-parallel simulation of the nondeterministic aho-corasick and suffix automata for a set of patterns. J. Discrete Algorithms\u00a011, 25\u201336 (2012)","journal-title":"J. Discrete Algorithms"},{"key":"23_CR6","unstructured":"Crochemore, M., Rytter, W.: Text algorithms. Oxford University Press (1994)"},{"issue":"6","key":"23_CR7","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1142\/S0129054109006991","volume":"20","author":"S. Faro","year":"2009","unstructured":"Faro, S., Lecroq, T.: Efficient variants of the backward-oracle-matching algorithm. Int. J. Found. Comput. Sci.\u00a020(6), 967\u2013984 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"23_CR8","first-page":"1012","volume":"arXiv","author":"S. Faro","year":"2010","unstructured":"Faro, S., Lecroq, T.: The exact string matching problem: a comprehensive experimental evaluation. Arxiv preprint arXiv:1012.2547 (2010)","journal-title":"Arxiv preprint"},{"key":"23_CR9","unstructured":"Faro, S., Lecroq, T.: Smart: a string matching algorithm research tool. Univ. of Catania and Univ. of Rouen (2011), \n                  \n                    http:\/\/www.dmi.unict.it\/~faro\/smart\/"},{"key":"23_CR10","unstructured":"Faro, S., Lecroq, T.: The exact online string matching problem: a review of the most recent results. ACM Computing Surveys (to appear)"},{"issue":"1","key":"23_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput.\u00a06(1), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"23_CR12","unstructured":"K\u00fclekci, M.O.: Filter based fast matching of long patterns by using SIMD instructions. In: Proc. of the Prague Stringology Conference, pp. 118\u2013128 (2009)"},{"issue":"4","key":"23_CR13","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11786-010-0035-4","volume":"3","author":"M.O. K\u00fclekci","year":"2010","unstructured":"K\u00fclekci, M.O.: Blim: A new bit-parallel pattern matching algorithm overcoming computer word size limitation. Mathematics in Comp. Science\u00a03(4), 407\u2013420 (2010)","journal-title":"Mathematics in Comp. Science"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Navarro, G., Raffinot, M.: A bit-parallel approach to suffix automata: Fast extended string matching. In: Comb. Pattern Matching, pp. 14\u201333 (1998)","DOI":"10.1007\/BFb0030778"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/351827.384246","volume":"5","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Raffinot, M.: Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM J. Experimental Algorithmics\u00a05, 4 (2000)","journal-title":"ACM J. Experimental Algorithmics"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Navarro, G., Raffinot, M.: Flexible pattern matching in strings - practical on-line search algorithms for texts and biological sequences. Cambridge Univ. Press (2002)","DOI":"10.1017\/CBO9781316135228"},{"issue":"2-3","key":"23_CR17","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.tcs.2004.03.058","volume":"321","author":"G. Navarro","year":"2004","unstructured":"Navarro, G., Fredriksson, K.: Average complexity of exact and approximate multiple string matching. Theor. Comput. Sci.\u00a0321(2-3), 283\u2013290 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-04241-6_21","volume-title":"Algorithms in Bioinformatics","author":"E. Rivals","year":"2009","unstructured":"Rivals, E., Salmela, L., Kiiskinen, P., Kalsi, P., Tarhio, J.: mpscan: Fast Localisation of Multiple Reads in Genomes. In: Salzberg, S.L., Warnow, T. (eds.) WABI 2009. LNCS, vol.\u00a05724, pp. 246\u2013260. Springer, Heidelberg (2009)"},{"key":"23_CR19","unstructured":"Wu, S., Manber, U.: Agrep \u2013 a fast approximate pattern-matching tool. In: Proc. of USENIX Winter 1992 Technical Conference, pp. 153\u2013162 (1992)"},{"key":"23_CR20","unstructured":"Wu, S., Manber, U.: A fast algorithm for multi-pattern searching. Report TR-94-17, Dep. of Computer Science, University of Arizona, Tucson, AZ (1994)"},{"issue":"10","key":"23_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1992","unstructured":"Wu, S., Manber, U.: Fast text searching: allowing errors. Commun. ACM\u00a035(10), 83\u201391 (1992)","journal-title":"Commun. ACM"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-642-32241-9_33","volume-title":"Computing and Combinatorics","author":"S. Gog","year":"2012","unstructured":"Gog, S., Karhu, K., K\u00e4rkk\u00e4inen, J., M\u00e4kinen, V., V\u00e4lim\u00e4ki, N.: Multi-pattern matching with bidirectional indexes. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol.\u00a07434, pp. 384\u2013395. Springer, Heidelberg (2012)"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Salmela, L., Tarhio, J., Kyotojoki, J.: Multi\u2013pattern string matching with q\u2013grams. ACM J. Experimental Algorithmics\u00a011 (2006)","DOI":"10.1145\/1187436.1187438"}],"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_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:45:08Z","timestamp":1620132308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34109-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341083","9783642341090"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34109-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}