{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T19:28:38Z","timestamp":1690226918346},"reference-count":32,"publisher":"Oxford University Press (OUP)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1093\/comjnl\/bxw023","type":"journal-article","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T14:23:14Z","timestamp":1467210194000},"page":"1749-1759","source":"Crossref","is-referenced-by-count":1,"title":["A Transformation For Optimizing String-Matching Algorithms For Long Patterns"],"prefix":"10.1093","volume":"59","author":[{"given":"Minhaj Ahmad","family":"Khan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2016,6,28]]},"reference":[{"key":"2016120903150693000_59.12.1749.1","doi-asserted-by":"crossref","first-page":"13:1","DOI":"10.1145\/2431211.2431212","article-title":"The exact online string matching problem: a review of the most recent results","volume":"45","author":"Faro","year":"2013","journal-title":"ACM Comput. Surv."},{"key":"2016120903150693000_59.12.1749.2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.312.0249"},{"key":"2016120903150693000_59.12.1749.3","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"2016120903150693000_59.12.1749.4","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380100608"},{"key":"2016120903150693000_59.12.1749.5","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79184"},{"key":"2016120903150693000_59.12.1749.6","unstructured":"Berry, T. and Ravindran, S. (1999) A fast string matching algorithm and experimental results. In J. Holub and M. Simanek, (eds) Proc. Prague Stringology Club Workshop \u201899. Prague, Czech Republic, pp. 16\u201328. Collaborative Report DC-99-05, Czech Technical University."},{"key":"2016120903150693000_59.12.1749.7","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211006"},{"key":"2016120903150693000_59.12.1749.8","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380221006"},{"key":"2016120903150693000_59.12.1749.9","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199707)27:7<851::AID-SPE108>3.0.CO;2-D"},{"key":"2016120903150693000_59.12.1749.10","first-page":"589","article-title":"Fast-search algorithms: new efficient variants of the Boyer-Moore pattern-matching algorithm","volume":"10","author":"Cantone","year":"2005","journal-title":"J. Automata Lang. Comb."},{"key":"2016120903150693000_59.12.1749.11","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1087"},{"key":"2016120903150693000_59.12.1749.12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_12"},{"key":"2016120903150693000_59.12.1749.13","doi-asserted-by":"publisher","DOI":"10.1007\/s11786-010-0035-4"},{"key":"2016120903150693000_59.12.1749.14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/978-3-642-21458-5_16","volume-title":"Combinatorial Pattern Matching, Lecture Notes in Computer Science","volume":"vol. 6661","author":"Breslauer","year":"2011"},{"key":"2016120903150693000_59.12.1749.15","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(83)90002-8"},{"key":"2016120903150693000_59.12.1749.16","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"2016120903150693000_59.12.1749.17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185427"},{"key":"2016120903150693000_59.12.1749.18","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116845"},{"key":"2016120903150693000_59.12.1749.19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2006.11.004"},{"key":"2016120903150693000_59.12.1749.20","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211105"},{"key":"2016120903150693000_59.12.1749.21","unstructured":"Hancart, C. (1993) Analyse exacte et en moyenne d'algorithmes de recherche d'un motif dans un texte. PhD Thesis, University Paris 7, France."},{"key":"2016120903150693000_59.12.1749.22","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/135239.135243","article-title":"A new approach to text searching","volume":"35","author":"Baeza-Yates","year":"1992","journal-title":"Commun. ACM"},{"key":"2016120903150693000_59.12.1749.23","doi-asserted-by":"crossref","unstructured":"Sharfuddin, A. and Feng, X. (2010) Improving Boyer-Moore-Horspool using machine-words for comparison. Proc. 48th Annual Southeast Regional Conf., New York, NY, USA, ACM SE \u201810, pp. 17:1\u201317:5. ACM.","DOI":"10.1145\/1900008.1900033"},{"key":"2016120903150693000_59.12.1749.24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03456-5_22"},{"key":"2016120903150693000_59.12.1749.25","unstructured":"K\u00fclekci, M.O. (2009) Filter based fast matching of long patterns by using SIMD instructions. In Holub, J. and \u017d\u010f\u00e1rek, J. (eds.) Proc. Prague Stringology Conf. 2009, Czech Technical University in Prague, Czech Republic, pp. 118\u2013128."},{"key":"2016120903150693000_59.12.1749.26","doi-asserted-by":"crossref","unstructured":"Faro, S. and K\u00fclekci, M.O. (2012) Fast multiple string matching using streaming SIMD extensions technology. Proc. 19th Int. Conf. String Processing and Information Retrieval, Berlin, Heidelberg SPIRE\u201912, pp. 217\u2013228. Springer.","DOI":"10.1007\/978-3-642-34109-0_23"},{"key":"2016120903150693000_59.12.1749.27","unstructured":"Faro, S. and Lecroq, T. (2013) SMART: string matching research tool. URL: http:\/\/www.dmi.unict.it\/faro\/smart\/index.php."},{"key":"2016120903150693000_59.12.1749.28","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030780"},{"key":"2016120903150693000_59.12.1749.29","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054109006991"},{"key":"2016120903150693000_59.12.1749.30","doi-asserted-by":"crossref","unstructured":"Faro, S. and K\u00fclekci, M.O. (2013) Fast packed string matching for short patterns. In 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, Louisiana, USA, January 7. pp. 113\u2013121. SIAM Publications Online.","DOI":"10.1137\/1.9781611972931.10"},{"key":"2016120903150693000_59.12.1749.31","unstructured":"Hongbo, F. , Nianmin, Y. and Haifeng, M. (2009) Fast variants of the Backward-Oracle-Matching algorithm. 2009 Fourth Int. Conf. Internet Computing for Science and Engineering (ICICSE), December, pp. 56\u201359."},{"key":"2016120903150693000_59.12.1749.32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47849-3_18"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/59\/12\/1749\/8344709\/bxw023.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,25]],"date-time":"2017-08-25T00:02:07Z","timestamp":1503619327000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxw023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,28]]},"references-count":32,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2016,12,9]]},"published-print":{"date-parts":[[2016,12]]}},"alternative-id":["10.1093\/comjnl\/bxw023"],"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxw023","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,28]]}}}