{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:38:13Z","timestamp":1764131893638,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030159955"},{"type":"electronic","value":"9783030159962"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-15996-2_4","type":"book-chapter","created":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T08:05:25Z","timestamp":1553501125000},"page":"45-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimizing Packed String Matching on AVX2 Platform"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1441-3650","authenticated-orcid":false,"given":"Mehmet Akif","family":"Aydo\u011fmu\u015f","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4583-6261","authenticated-orcid":false,"given":"M. O\u011fuzhan","family":"K\u00fclekci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,26]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Durian, B., Holub, J., Peltola, H., Tarhio, J.: Tuning BNDM with q-grams. In: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 29\u201337 (2009)","DOI":"10.1137\/1.9781611972894.3"},{"key":"4_CR2","unstructured":"Peltola, H., Tarhio, J.: Variations of forward-SBNDM. In: Proceedings of the Prague Stringology Conference 2011, Prague, Czech Republic, 29\u201331 August 2011 (2011)"},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.ipl.2009.11.010","volume":"110","author":"B Durian","year":"2010","unstructured":"Durian, B., Holub, J., Peltola, H., Tarhio, J.: Improving practical exact string matching. Inf. Process. Lett. 110(4), 148\u2013152 (2010)","journal-title":"Inf. Process. Lett."},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-47849-3_18","volume-title":"SOFSEM\u201999: Theory and Practice of Informatics","author":"C Allauzen","year":"1999","unstructured":"Allauzen, C., Crochemore, M., Raffinot, M.: Factor Oracle: a new structure for pattern matching. In: Pavelka, J., Tel, G., Barto\u0161ek, M. (eds.) SOFSEM 1999. LNCS, vol. 1725, pp. 295\u2013310. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/3-540-47849-3_18"},{"key":"4_CR5","unstructured":"Cantone, D., Faro, S.: Searching for a substring with constant extra-space complexity. In: Ferragina, P., Grossi, R. (eds.) Proceedings of Third International Conference on Fun with Algorithms, pp. 118\u2013131 (2004)"},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"4_CR7","unstructured":"Cantone, D., Faro, S., Pavone, A.: Speeding up string matching by weak factor recognition. In: Stringology, pp. 42\u201350 (2017)"},{"key":"4_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-38827-4_12","volume-title":"AlCoB 2016","author":"S Faro","year":"2016","unstructured":"Faro, S.: Evaluation and improvement of fast algorithms for exact matching on genome sequences. In: Bot\u00f3n-Fern\u00e1ndez, M., Mart\u00edn-Vide, C., Santander-Jim\u00e9nez, S., Vega-Rodr\u00edguez, M. (eds.) AlCoB 2016. LNCS. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-38827-4_12"},{"key":"4_CR9","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. Exp. Algorithmics (JEA) 5, 4 (2000)","journal-title":"ACM J. Exp. Algorithmics (JEA)"},{"key":"4_CR10","unstructured":"Tarhio, J., Holub, J., Giaquinta, E.: Technology beats algorithms (in exact string matching). CoRR, abs\/1612.01506 \n                      http:\/\/arxiv.org\/abs\/1612.01506\n                      \n                     (2016)"},{"key":"4_CR11","unstructured":"Kulekci, M.O.: Filter based fast matching of long patterns by using SIMD instructions. In: Holub, J., Zdarek, J. (eds.) Proceedings of the Prague Stringology Conference 2009. Czech Technical University in Prague, Czech Republic, pp. 118\u2013128 (2009)"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"RM Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. Math. Comput. 31(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev. Math. Comput."},{"issue":"10","key":"4_CR13","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"RS Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM 20(10), 762\u2013772 (1977)","journal-title":"Commun. ACM"},{"issue":"1","key":"4_CR14","first-page":"47","volume":"91","author":"R Thathoo","year":"2006","unstructured":"Thathoo, R., Virmani, A., Lakshmi, S.S., Balakrishnan, N., Sekar, K.: TVSBS: a fast exact pattern matching algorithm for biological sequences. Curr. Sci. 91(1), 47\u201353 (2006)","journal-title":"Curr. Sci."},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-34109-0_23","volume-title":"String Processing and Information Retrieval","author":"S Faro","year":"2012","unstructured":"Faro, S., K\u00fclekci, M.O.: Fast multiple string matching using streaming SIMD extensions technology. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 217\u2013228. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-34109-0_23"},{"key":"4_CR16","unstructured":"Faro, S., Lecroq, T., Borzi, S., Di Mauro, S., Maggio, A.: The string matching algorithms research tool. In: Proceedings of Stringology, pp. 99\u2013111 (2016)"},{"key":"4_CR17","unstructured":"Faro, S.: Exact online string matching bibliography. CoRR, abs\/1605.05067 \n                      http:\/\/arxiv.org\/abs\/1605.05067\n                      \n                     (2016)"},{"key":"4_CR18","unstructured":"Faro, S., Lecroq T.: The exact string matching problem: a comprehensive experimental evaluation. CoRR, abs\/1012.2547 \n                      http:\/\/arxiv.org\/abs\/1012.2547\n                      \n                     (2010)"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/2431211.2431212","volume":"45","author":"S Faro","year":"2013","unstructured":"Faro, S., Lecroq, T.: The exact online string matching problem: a review of the most recent results. ACM Comput. Surv. 45(2), 13 (2013)","journal-title":"ACM Comput. Surv."},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-31606-7_13","volume-title":"Implementation and Application of Automata","author":"S Faro","year":"2012","unstructured":"Faro, S., Lecroq, T.: A fast suffix automata based algorithm for exact online string matching. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol. 7381, pp. 149\u2013158. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-31606-7_13"},{"key":"4_CR21","unstructured":"Faro, S., Lecroq, T.: Efficient variants of the backward-oracle-matching algorithm. In: Proceedings of the Prague Stringology Conference, pp. 146\u2013160. Czech Technical University in Prague, Czech Republic (2008)"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Faro, S., K\u00fclekci, M.O.: Fast packed string matching for short patterns. In: Sanders, P., Zeh N. (eds.) Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, ALENEX. SIAM, New Orleans, LA, USA, pp. 113\u2013121 (2013)","DOI":"10.1137\/1.9781611972931.10"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-41168-2_6","volume-title":"Algorithmic Aspects in Information and Management","author":"S Faro","year":"2016","unstructured":"Faro, S.: A very fast string matching algorithm based on condensed alphabets. In: Dondi, R., Fertin, G., Mauri, G. (eds.) AAIM 2016. LNCS, vol. 9778, pp. 65\u201376. Springer, Cham (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-319-41168-2_6"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-33074-2_19","volume-title":"Advances in Databases and Information Systems","author":"S Ladra","year":"2012","unstructured":"Ladra, S., Pedreira, O., Duato, J., Brisaboa, N.R.: Exploiting SIMD instructions in current processors to improve classical string algorithms. In: Morzy, T., H\u00e4rder, T., Wrembel, R. (eds.) ADBIS 2012. LNCS, vol. 7503, pp. 254\u2013267. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-33074-2_19"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1002\/spe.2433","volume":"47","author":"T Chhabra","year":"2017","unstructured":"Chhabra, T., Faro, S., K\u00fclekci, M.O., Tarhio, J.: Engineering order-preserving pattern matching with SIMD parallelism. Softw. Pract. Exper. 47, 731\u2013739 (2017). \n                      https:\/\/doi.org\/10.1002\/spe.2433","journal-title":"Softw. Pract. Exper."},{"key":"4_CR26","unstructured":"https:\/\/software.intel.com\/en-us\/vtune-amplifier-help-intel-processor-events-reference"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing for Computational Science \u2013 VECPAR 2018"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-15996-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:08:47Z","timestamp":1558343327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-15996-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030159955","9783030159962"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-15996-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VECPAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Vector and Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"S\u00e3o Pedro","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vecpar2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/vecpar2018.ncc.unesp.br\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}