{"title":"反向oracle前进算法的快速变体","authors":"Hongbo Fan, Nianmin Yao, Haifeng Ma","doi":"10.1109/ICICSE.2009.53","DOIUrl":null,"url":null,"abstract":"This study focuses on the faster exact single pattern string matching algorithms. In all solutions, two variants of BOM, EBOM and FBOM are very efficient. We improved them and presented two algorithms named Simplified-EBOM and Simplified-FBOM through removing the unnecessary branches and accomplishing the core calculation of the algorithm in a 1-dimensional array. The experimental results indicated that Simplified-EBOM is fast for short patterns and it is 12% faster than its basis algorithm on average.","PeriodicalId":193621,"journal":{"name":"2009 Fourth International Conference on Internet Computing for Science and Engineering","volume":"135 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Fast Variants of the Backward-Oracle-Marching Algorithm\",\"authors\":\"Hongbo Fan, Nianmin Yao, Haifeng Ma\",\"doi\":\"10.1109/ICICSE.2009.53\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This study focuses on the faster exact single pattern string matching algorithms. In all solutions, two variants of BOM, EBOM and FBOM are very efficient. We improved them and presented two algorithms named Simplified-EBOM and Simplified-FBOM through removing the unnecessary branches and accomplishing the core calculation of the algorithm in a 1-dimensional array. The experimental results indicated that Simplified-EBOM is fast for short patterns and it is 12% faster than its basis algorithm on average.\",\"PeriodicalId\":193621,\"journal\":{\"name\":\"2009 Fourth International Conference on Internet Computing for Science and Engineering\",\"volume\":\"135 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fourth International Conference on Internet Computing for Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICSE.2009.53\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fourth International Conference on Internet Computing for Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICSE.2009.53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast Variants of the Backward-Oracle-Marching Algorithm
This study focuses on the faster exact single pattern string matching algorithms. In all solutions, two variants of BOM, EBOM and FBOM are very efficient. We improved them and presented two algorithms named Simplified-EBOM and Simplified-FBOM through removing the unnecessary branches and accomplishing the core calculation of the algorithm in a 1-dimensional array. The experimental results indicated that Simplified-EBOM is fast for short patterns and it is 12% faster than its basis algorithm on average.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
