{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T11:28:29Z","timestamp":1767007709184,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201779"},{"type":"electronic","value":"9783540399841"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39984-1_7","type":"book-chapter","created":{"date-parts":[[2010,10,21]],"date-time":"2010-10-21T17:26:45Z","timestamp":1287682005000},"page":"80-93","source":"Crossref","is-referenced-by-count":39,"title":["Alternative Algorithms for Bit-Parallel String Matching"],"prefix":"10.1007","author":[{"given":"Hannu","family":"Peltola","sequence":"first","affiliation":[]},{"given":"Jorma","family":"Tarhio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Arndt, J.: J\u00f6rgs useful and ugly BIT WIZARDRY page, \n                      http:\/\/www.jjj.de\/bitwizardry\/bitwizardrypage.html","key":"7_CR1"},{"issue":"10","key":"7_CR2","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A Fast String Searching Algorithm. Communications of the ACM\u00a020(10), 762\u2013772 (1977)","journal-title":"Communications of the ACM"},{"key":"7_CR3","volume-title":"Text algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text algorithms. Oxford University Press, Oxford (1994)"},{"issue":"9","key":"7_CR4","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1145\/359146.359148","volume":"22","author":"Z. Galil","year":"1979","unstructured":"Galil, Z.: On Improving the Worst Case Running Time of the Boyer\u2013Moore String Matching Algorithm. Communications of the ACM\u00a022(9), 505\u2013508 (1979)","journal-title":"Communications of the ACM"},{"issue":"6","key":"7_CR5","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 \u2014 Practice and Experience\u00a010(6), 501\u2013506 (1980)","journal-title":"Software \u2014 Practice and Experience"},{"issue":"11","key":"7_CR6","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1002\/spe.4380211105","volume":"21","author":"A. Hume","year":"1991","unstructured":"Hume, A., Sunday, D.: Fast String Searching. Software \u2014 Practice and Experience\u00a021(11), 1221\u20131248 (1991)","journal-title":"Software \u2014 Practice and Experience"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-44888-8_16","volume-title":"Combinatorial Pattern Matching","author":"J. Kyt\u00f6joki","year":"2003","unstructured":"Kyt\u00f6joki, J., Salmela, L., Tarhio, J.: Tuning string matching for huge pattern sets. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 211\u2013224. Springer, Heidelberg (2003)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BFb0030778","volume-title":"Combinatorial Pattern Matching","author":"G. Navarro","year":"1998","unstructured":"Navarro, G., Raffinot, M.: A Bit-parallel Approach to Suffix Automata: Fast Extended String Matching. In: Farach-Colton, M. (ed.) CPM 1998. LNCS, vol.\u00a01448, pp. 14\u201333. Springer, Heidelberg (1998)"},{"issue":"4","key":"7_CR9","first-page":"1","volume":"5","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Raffinot, M.: Fast and Flexible String Matching by Combining Bitparallelism and Suffix automata. ACM Journal of Experimental Algorithms\u00a05(4), 1\u201336 (2000)","journal-title":"ACM Journal of Experimental Algorithms"},{"issue":"8","key":"7_CR10","doi-asserted-by":"publisher","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. Communications of the ACM\u00a033(8), 132\u2013142 (1990)","journal-title":"Communications of the ACM"},{"issue":"7","key":"7_CR11","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 \u2014 Practice and Experience\u00a027(7), 851\u2013861 (1997)","journal-title":"Software \u2014 Practice and Experience"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1137\/0220002","volume":"20","author":"U. Vishkin","year":"1991","unstructured":"Vishkin, U.: Deterministic Sampling\u2014a New Technique for Fast Pattern Matching. SIAM Journal of Computing\u00a020(1), 22\u201340 (1991)","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39984-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T21:07:29Z","timestamp":1674853649000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-39984-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201779","9783540399841"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39984-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}