A new string matching algorithm

被引:5
|
作者
Ahmed, M [1 ]
Kaykobad, M
Chowdhury, RA
机构
[1] Bangladesh Univ Engn & Technol, Dept Comp Sci & Engn, Dhaka 1000, Bangladesh
[2] Univ Texas, Dept Comp Sci, Austin, TX 78712 USA
关键词
string matching; complexity; Boyer-Moore algorithm;
D O I
10.1080/0020716031000087113
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper a new exact string-matching algorithm with sub-linear average case complexity has been presented. Unlike other sub-linear string-matching algorithms it never performs more than n text character comparisons while working on a text of length n . It requires only O (m +sigma) extra pre-processing time and space, where m is the length of the pattern and sigma is the size of the alphabet.
引用
收藏
页码:825 / 834
页数:10
相关论文
共 50 条