{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:44Z","timestamp":1759637864369},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_12","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T07:54:59Z","timestamp":1272354899000},"page":"129-140","source":"Crossref","is-referenced-by-count":20,"title":["Bit-Parallel Search Algorithms for Long Patterns"],"prefix":"10.1007","author":[{"given":"Branislav","family":"\u010eurian","sequence":"first","affiliation":[]},{"given":"Hannu","family":"Peltola","sequence":"additional","affiliation":[]},{"given":"Leena","family":"Salmela","sequence":"additional","affiliation":[]},{"given":"Jorma","family":"Tarhio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812778222","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific Publishing Company, Singapore (2002)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"\u010eurian, B., Holub, J., Peltola, H., Tarhio, J.: Tuning BNDM with q-Grams. In: Proc. ALENEX 2009, the Tenth Workshop on Algorithm Engineering and Experiments, pp. 29\u201337 (2009)","DOI":"10.1137\/1.9781611972894.3"},{"key":"12_CR3","unstructured":"Faro, S., Lecroq, T.: Efficient variants of the backward-oracle-matching algorithm. In: Proc. PSC 2008, The 13th Prague Stringology Conference, pp. 146\u2013160 (2008)"},{"issue":"1.4","key":"12_CR4","first-page":"1","volume":"9","author":"K. Fredriksson","year":"2004","unstructured":"Fredriksson, K., Navarro, G.: Average-optimal single and multiple approximate string matching. ACM Journal of Experimental Algorithmics\u00a09(1.4), 1\u201347 (2004)","journal-title":"ACM Journal of Experimental Algorithmics"},{"issue":"1-3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.tcs.2004.12.002","volume":"332","author":"L. He","year":"2005","unstructured":"He, L., Fang, B., Sui, J.: The wide window string matching algorithm. Theoretical Computer Science\u00a0332(1-3), 391\u2013404 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"12_CR6","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"R.N. Horspool","year":"1980","unstructured":"Horspool, R.N.: Practical fast searching in strings. Software \u2013 Practice and Experience\u00a010(6), 501\u2013506 (1980)","journal-title":"Software \u2013 Practice and Experience"},{"issue":"11","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1002\/spe.4380211105","volume":"21","author":"A. Hume","year":"1991","unstructured":"Hume, A., Sunday, D.M.: Fast string searching. Software \u2013 Practice and Experience\u00a021(11), 1221\u20131248 (1991)","journal-title":"Software \u2013 Practice and Experience"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-540-92182-0_45","volume-title":"Algorithms and Computation","author":"M.O. K\u00fclekci","year":"2008","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.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 496\u2013506. Springer, Heidelberg (2008)"},{"key":"12_CR9","unstructured":"K\u00fclekci, M.O.: Filter based fast matching of long patterns by using SIMD instructions. In: Proc. of the Prague Stringology Conference 2009, pp. 118\u2013128 (2009)"},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.ipl.2007.01.002","volume":"102","author":"T. Lecroq","year":"2007","unstructured":"Lecroq, T.: Fast exact string matching algorithms. Information Processing Letters\u00a0102(6), 229\u2013235 (2007)","journal-title":"Information Processing Letters"},{"issue":"4","key":"12_CR11","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 Journal of Experimental Algorithmics\u00a05(4), 1\u201336 (2000)","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"12_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316135228","volume-title":"Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Raffinot, M.: Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences. Cambridge University Press, New York (2002)"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/978-3-540-39984-1_7","volume-title":"String Processing and Information Retrieval","author":"H. Peltola","year":"2003","unstructured":"Peltola, H., Tarhio, J.: Alternative algorithms for bit-parallel string matching. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 80\u201393. Springer, Heidelberg (2003)"},{"issue":"7","key":"12_CR14","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1002\/(SICI)1097-024X(199707)27:7<851::AID-SPE108>3.0.CO;2-D","volume":"27","author":"J. Tarhio","year":"1997","unstructured":"Tarhio, J., Peltola, H.: String matching in the DNA alphabet. Software \u2013 Practice and Experience\u00a027(7), 851\u2013861 (1997)","journal-title":"Software \u2013 Practice and Experience"},{"key":"12_CR15","unstructured":"Wu, S., Manber, U.: Agrep \u2013 a fast approximate pattern searching tool. In: Proceedings of the Winter USENIX Technical Conference, pp. 153\u2013162 (1992)"},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1137\/0208029","volume":"8","author":"A.C.-C. Yao","year":"1979","unstructured":"Yao, A.C.-C.: The complexity of pattern matching for a random string. SIAM Journal on Computing\u00a08(3), 368\u2013387 (1979)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-02270-8_34","volume-title":"Frontiers in Algorithmics","author":"G. Zhang","year":"2009","unstructured":"Zhang, G., Zhu, E., Mao, L., Yin, M.: A bit-parallel exact string matching algorithm for small alphabet. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol.\u00a05598, pp. 336\u2013345. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:02:31Z","timestamp":1606168951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}