{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:35:26Z","timestamp":1725521726654},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_45","type":"book-chapter","created":{"date-parts":[[2008,12,9]],"date-time":"2008-12-09T21:38:06Z","timestamp":1228858686000},"page":"496-506","source":"Crossref","is-referenced-by-count":9,"title":["A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching"],"prefix":"10.1007","author":[{"given":"M. O\u01e7uzhan","family":"K\u00fclekci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. Aho","year":"1975","unstructured":"Aho, A., Corasick, M.: Efficient string matching: An aid to bibliographic search. Communications of the ACM\u00a018, 333\u2013340 (1975)","journal-title":"Communications of the ACM"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0020-0190(99)00092-7","volume":"71","author":"M. Crochemore","year":"1993","unstructured":"Crochemore, M., Czumaj, A., Gasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W., Rytter, W.: Fast practical multi-pattern matching. Information Processing Letters\u00a071, 107\u2013113 (1993)","journal-title":"Information Processing Letters"},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01185427","volume":"12","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Czumaj, A., Gasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W., Rytter, W.: Speeding up two string matching algorithms. Algorithmica\u00a012, 247\u2013267 (1994)","journal-title":"Algorithmica"},{"key":"45_CR4","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994)"},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R. Boyer","year":"1977","unstructured":"Boyer, R., Moore, J.: A fast string searching algorithm. Communications of the ACM\u00a020, 762\u2013772 (1977)","journal-title":"Communications of the ACM"},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. Knuth","year":"1977","unstructured":"Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM Journal of Computing\u00a06, 323\u2013350 (1977)","journal-title":"SIAM Journal of Computing"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/79173.79184","volume":"33","author":"D. Sunday","year":"1990","unstructured":"Sunday, D.: A very fast substring search algorithm. Communications of the ACM\u00a033, 132\u2013142 (1990)","journal-title":"Communications of the ACM"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Horspool, N.: Practical fast searching in strings. Software \u2013 Practice and Experience\u00a010 (1980)","DOI":"10.1002\/spe.4380100608"},{"key":"45_CR9","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":"45_CR10","doi-asserted-by":"publisher","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. Communications of the ACM\u00a035, 83\u201391 (1992)","journal-title":"Communications of the ACM"},{"key":"45_CR11","unstructured":"Wu, S., Manber, U.: Agrep \u2013 a fast approximate pattern-matching tool. In: USENIX Winter, Technical Conference, pp. 153\u2013162 (1992)"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/351827.351829","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 Algorithms\u00a05, 1\u201336 (2000)","journal-title":"ACM Journal of Experimental Algorithms"},{"key":"45_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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\u201394. Springer, Heidelberg (2003)"},{"key":"45_CR14","unstructured":"Charras, C., Lecroq, T.: Handbook of exact string matching algorithms. King\u2019s Collage Publications (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T23:44:18Z","timestamp":1557963858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}