{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T22:25:47Z","timestamp":1743459947205},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022692"},{"type":"electronic","value":"9783642022708"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02270-8_34","type":"book-chapter","created":{"date-parts":[[2009,6,19]],"date-time":"2009-06-19T01:17:47Z","timestamp":1245374267000},"page":"336-345","source":"Crossref","is-referenced-by-count":6,"title":["A Bit-Parallel Exact String Matching Algorithm for Small Alphabet"],"prefix":"10.1007","author":[{"given":"Guomin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"En","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","unstructured":"Charras, C., Lecroq, T.: Exact string matching algorithms. King\u2019s College Publications (2004)"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM Journal on Computing\u00a06, 323\u2013350 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R., Gonnet, G.: A new approach to text searching. Communications of the ACM\u00a035, 74\u201382 (1992)","journal-title":"Communications of the ACM"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R. Boyer","year":"1977","unstructured":"Boyer, R., Moore, S.: A fast string searching algorithm. Communications of the ACM\u00a020, 762\u2013772 (1977)","journal-title":"Communications of the ACM"},{"key":"34_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 Practice and Experience\u00a010, 501\u2013506 (1980)","journal-title":"Software Practice and Experience"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01185427","volume":"12","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Czumaj, A., G\u0105sieniec, L., Jarominek, S., Lecroq, T., Plandowski, W., Rytter, W.: Speeding up two string-matching algorithms. Algorithmica\u00a012, 247\u2013267 (1994)","journal-title":"Algorithmica"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Navarro, G., Raffinot, M.: Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics\u00a05 (2000), http:\/\/www.jea.acm.org\/2000\/NavarroString","DOI":"10.1145\/351827.384246"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"\u010eurian, B., Holub, J., Peltola, H., Tarhio, J.: Tuning BNDM with q-Grams. In: Proc. ALENEX 2009, Tenth Workshop on Algorithm Engineering and Experiments. SIAM 2009, pp. 29\u201337 (2009)","DOI":"10.1137\/1.9781611972894.3"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-48194-X_5","volume-title":"Combinatorial Pattern Matching","author":"C. Allauzen","year":"2001","unstructured":"Allauzen, C., Crochemore, M., Raffinot, M.: Efficient experimental string matching by weak factor recognition. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 51\u201372. Springer, Heidelberg (2001)"},{"key":"34_CR10","unstructured":"Faro, S., Lecroq, T.: Efficient Variants of the Backward-Oracle-Matching Algorithm. In: Prague Stringology Conference 2008, pp. 146\u2013160 (2008)"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R.M. Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev.\u00a031, 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev."},{"key":"34_CR12","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, 229\u2013235 (2007)","journal-title":"Information Processing Letters"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0020-0190(03)00296-5","volume":"87","author":"K. Fredriksson","year":"2003","unstructured":"Fredriksson, K.: Shift-or string matching with super-alphabets. Information Processing Letters\u00a087, 201\u2013204 (2003)","journal-title":"Information Processing Letters"},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/11575832_42","volume-title":"String Processing and Information Retrieval","author":"K. Fredriksson","year":"2005","unstructured":"Fredriksson, K., Grabowski, S.: Practical and optimal string matching. In: Consens, M.P., Navarro, G. (eds.) SPIRE 2005. LNCS, vol.\u00a03772, pp. 376\u2013387. Springer, Heidelberg (2005)"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Prasad, R., Agarwal, S.: A new parameterized string matching algorithm by combining bit-parallelism and suffix automata. In: Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States, pp. 778\u2013783 (2008)","DOI":"10.1109\/CIT.2008.4594773"},{"key":"34_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1007\/978-3-540-92182-0_45","volume-title":"ISAAC 2008","author":"M.O. K\u00fclekci","year":"2008","unstructured":"K\u00fclekci, M.O.: T\u00dcB\u0130TAK-UEKAE: 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":"34_CR17","unstructured":"Canterbury Corpus Database (2009), http:\/\/corpus.canterbury.ac.nz\/descriptions\/"},{"key":"34_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316135228","volume-title":"String Matching. 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.: String Matching. Flexible Pattern Matching in Strings: Practical On-line Search Algorithms for Texts and Biological Sequences. Cambridge University Press, Cambridge (2002)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02270-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T20:09:27Z","timestamp":1558382967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02270-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022692","9783642022708"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02270-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}