{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:26:33Z","timestamp":1750249593507},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,4,13]],"date-time":"2010-04-13T00:00:00Z","timestamp":1271116800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s11786-010-0035-4","type":"journal-article","created":{"date-parts":[[2010,4,12]],"date-time":"2010-04-12T21:12:23Z","timestamp":1271106743000},"page":"407-420","source":"Crossref","is-referenced-by-count":9,"title":["BLIM: A New Bit-Parallel Pattern Matching Algorithm Overcoming Computer Word Size Limitation"],"prefix":"10.1007","volume":"3","author":[{"given":"M. O\u011fuzhan","family":"K\u00fclekci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,13]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","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 18, 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"key":"35_CR2","volume-title":"Pattern Matching Algorithms","year":"1997","unstructured":"Apostolico, A., Galil, Z. (eds): Pattern Matching Algorithms. Oxford University Press, Oxford (1997)"},{"issue":"10","key":"35_CR3","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R.A. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates R.A., Gonnet G.H.: A new approach to text searching. Commun. ACM 35(10), 74\u201382 (1992)","journal-title":"Commun. ACM"},{"key":"35_CR4","volume-title":"Handbook of Exact String Matching Algorithms","author":"C. Charras","year":"2004","unstructured":"Charras C., Lecroq T.: Handbook of Exact String Matching Algorithms. King\u2019s Collage Publications, London (2004)"},{"key":"35_CR5","unstructured":"Cleophas, L., Watson, B.W., Zwaan, G.: A new taxonomy of sublinear keyword pattern matching algorithms. Computer Science Report 04-07, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, April 2004"},{"key":"35_CR6","volume-title":"Jewels of stringology","author":"M. Crochemore","year":"2003","unstructured":"Crochemore M., Rytter W.: Jewels of stringology. World Scientific Publishing, Singapore (2003)"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Durian, B., Holub, J., Peltola, H., Tarhio, J.: Tuning BNDM with q-grams. In: Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX09), pp. 29\u201337, New York City, January 2009","DOI":"10.1137\/1.9781611972894.3"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Fredriksson, K.: Faster string matching with super\u2013alphabets. In: Proceedings of the 9th International Symposium on String Processing and Information Retrieval (SPIRE\u20192002), LNCS, vol. 2476, pp. 44\u201357. Springer-Verlag, New York (2002)","DOI":"10.1007\/3-540-45735-6_5"},{"key":"35_CR9","unstructured":"Fredriksson, K., Grabowski, S.: Practical and optimal string matching. In: Proceedings of the 12th International Symposium on String Processing and Information Retrieval (SPIRE\u20192005), LNCS, vol. 3772, pp. 374\u2013385. Springer-Verlag, New York (2005)"},{"issue":"4","key":"35_CR10","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/j.jda.2008.09.001","volume":"7","author":"K. Fredriksson","year":"2009","unstructured":"Fredriksson K., Grabowsky S.: Average-optimal string matching. J. Discrete Algorithms 7(4), 579\u2013594 (2009)","journal-title":"J. Discrete Algorithms"},{"key":"35_CR11","unstructured":"Holub, J., Durian, B.: Fast variants of bit parallel approach to suffix automata. Unpublished Lecture, University of Haifa, April 2005"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"K\u00fclekci, M.O.: A method to overcome computer word size limitation in bit-parallel pattern matching. In: Hong, S.-H, Nagamochi, H., Fukunaga, T. (eds.) Proceedings of 19th International Symposium on Algorithms and Computation, ISAAC\u20192008. Lecture Notes in Computer Science, vol. 5369, pp. 496\u2013506, Gold Coast, Australia, December 2008. Springer-Verlag (2008)","DOI":"10.1007\/978-3-540-92182-0_45"},{"key":"35_CR13","unstructured":"K\u00fclekci, M.O.: Overcoming computer word size limitation in bit-parallel pattern matching. Talk given in LSD&LAW\u201909, London Stringology Days & London Algorithmic Workshop, King\u2019s College, London, UK, February 2009"},{"issue":"4","key":"35_CR14","first-page":"1","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. Algorithms 5(4), 1\u201336 (2000)","journal-title":"ACM J. Exp. Algorithms"},{"key":"35_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316135228","volume-title":"Flexible Pattern Matching in Strings\u2014Practical On-line Search Algorithms for Texts and Biological Sequences","author":"G. Navarro","year":"2002","unstructured":"Navarro G., Raffinot M.: Flexible Pattern Matching in Strings\u2014Practical On-line Search Algorithms for Texts and Biological Sequences. Cambridge University Press, Cambridge (2002)"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Peltola, H., Tarhio, J.: Alternative algorithms for bit-parallel string matching. In: LNCS, vol. 2857, Proceedings of SPIRE\u20192003, pp. 80\u201394 (2003)","DOI":"10.1007\/978-3-540-39984-1_7"},{"issue":"8","key":"35_CR17","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/79173.79184","volume":"33","author":"D.M. Sunday","year":"1990","unstructured":"Sunday D.M.: A very fast substring search algorithm. Commun. ACM 33(8), 132\u2013142 (1990)","journal-title":"Commun. ACM"},{"key":"35_CR18","unstructured":"Watson, B.W.: A new family of Commentz-Walter-style multiple-keyword pattern matching algorithms. In: Proceedings of the Prague Stringology Club Workshop, pp. 71\u201376 (2000)"},{"key":"35_CR19","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1002\/spe.590","volume":"34","author":"B.W. Watson","year":"2004","unstructured":"Watson B.W., Cleophas L.: SPARE parts: a C++ toolkit for string pattern recognition. Softw. Pract. Exp. 34, 697\u2013710 (2004)","journal-title":"Softw. Pract. Exp."},{"issue":"10","key":"35_CR20","doi-asserted-by":"crossref","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 35(10), 83\u201391 (1992)","journal-title":"Commun. ACM"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-010-0035-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-010-0035-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-010-0035-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T22:32:28Z","timestamp":1559428348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-010-0035-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,13]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["35"],"URL":"https:\/\/doi.org\/10.1007\/s11786-010-0035-4","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,13]]}}}