Fast Variants of the Backward-Oracle-Marching Algorithm

2009 Fourth International Conference on Internet Computing for Science and Engineering Pub Date : 2009-12-21 DOI:10.1109/ICICSE.2009.53

Hongbo Fan, Nianmin Yao, Haifeng Ma

引用次数: 13

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.

查看原文本刊更多论文

反向oracle前进算法的快速变体

本文主要研究快速精确的单模式字符串匹配算法。在所有的解决方案中，EBOM和FBOM这两种BOM变体都是非常高效的。对其进行改进，通过去除不必要的分支，在一维数组中完成算法的核心计算，提出了简化ebom和简化fbom两种算法。实验结果表明，简化ebom算法对短模式的识别速度较快，平均比基本算法快12%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2009 Fourth International Conference on Internet Computing for Science and Engineering

自引率

0.00%

发文量