{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:29Z","timestamp":1750307369345,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,1,22]],"date-time":"2010-01-22T00:00:00Z","timestamp":1264118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,1,22]]},"DOI":"10.1145\/1754288.1754298","type":"proceedings-article","created":{"date-parts":[[2010,4,2]],"date-time":"2010-04-02T14:50:55Z","timestamp":1270219855000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient bit-parallel multi-patterns string matching algorithms for limited expression"],"prefix":"10.1145","author":[{"given":"Rajesh","family":"Prasad","sequence":"first","affiliation":[{"name":"Motilal Nehru National Institute of Technology, Allahabad, India"}]},{"given":"Suneeta","family":"Agarwal","sequence":"additional","affiliation":[{"name":"Motilal Nehru National Institute of Technology, Allahabad, India"}]},{"given":"Ishadutta","family":"Yadav","sequence":"additional","affiliation":[{"name":"Motilal Nehru National Institute of Technology, Allahabad, India"}]},{"given":"Bharat","family":"Singh","sequence":"additional","affiliation":[{"name":"Motilal Nehru National Institute of Technology, Allahabad, India"}]}],"member":"320","published-online":{"date-parts":[[2010,1,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/135239.135243"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1187436.1187438"},{"key":"e_1_3_2_1_5_1","first-page":"263","volume-title":"Optimal Shift-or string matching algorithm for multiple patterns\" In Proceedings of International Conference on Computer Science and Applications (WCECS-07)","author":"Prasad R.","year":"2007","unstructured":"R. Prasad and S. Agarwal , \" Optimal Shift-or string matching algorithm for multiple patterns\" In Proceedings of International Conference on Computer Science and Applications (WCECS-07) , San Francisco, USA , October 24--26, 2007 , pp. 263 -- 266 R. Prasad and S. Agarwal, \"Optimal Shift-or string matching algorithm for multiple patterns\" In Proceedings of International Conference on Computer Science and Applications (WCECS-07), San Francisco, USA, October 24--26, 2007, pp. 263--266"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/351827.384246"},{"key":"e_1_3_2_1_7_1","first-page":"29","volume-title":"proc. of Tength Workshops on Algorithm Engineering and Experiments","author":"Durian","year":"2009","unstructured":"Durian B, Holub J, Peltola H, Tarhio J. Tuning BNDM with q-grams . In proc. of Tength Workshops on Algorithm Engineering and Experiments , 2009 , pp. 29 -- 37 . Durian B, Holub J, Peltola H, Tarhio J. Tuning BNDM with q-grams. In proc. of Tength Workshops on Algorithm Engineering and Experiments, 2009, pp. 29--37."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216067"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-642-82456-2_2","volume-title":"Combinatorial Algorithm on words","author":"Pinter R. Y.","year":"1985","unstructured":"R. Y. Pinter , \" Efficient string matching with don't care pattern\" , In Combinatorial Algorithm on words , Springer Verlag Berlin , pp. 11 -- 29 , 1985 . R. Y. Pinter, \"Efficient string matching with don't care pattern\", In Combinatorial Algorithm on words, Springer Verlag Berlin, pp. 11--29, 1985."}],"event":{"name":"Compute '10: ACM Bangalore Chapter Annual Conference","sponsor":["ACM Bangalore chapter","SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Bangalore India","acronym":"Compute '10"},"container-title":["Proceedings of the Third Annual ACM Bangalore Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1754288.1754298","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1754288.1754298","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:49Z","timestamp":1750245769000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1754288.1754298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,22]]},"references-count":9,"alternative-id":["10.1145\/1754288.1754298","10.1145\/1754288"],"URL":"https:\/\/doi.org\/10.1145\/1754288.1754298","relation":{},"subject":[],"published":{"date-parts":[[2010,1,22]]},"assertion":[{"value":"2010-01-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}