IMPROVED STRING SEARCHING

被引:42
作者
BAEZAYATES, RA
机构
关键词
D O I
10.1002/spe.4380190305
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:257 / 271
页数:15
相关论文
共 13 条
[1]   THE BOYER-MOORE-GALIL STRING SEARCHING STRATEGIES REVISITED [J].
APOSTOLICO, A ;
GIANCARLO, R .
SIAM JOURNAL ON COMPUTING, 1986, 15 (01) :98-105
[2]  
BAEZAYATES R, 1987, CS8766 U WAT DEP COM
[3]   FAST STRING SEARCHING ALGORITHM [J].
BOYER, RS ;
MOORE, JS .
COMMUNICATIONS OF THE ACM, 1977, 20 (10) :762-772
[4]   KANTOROVICH-TYPE INEQUALITIES [J].
CLAUSING, A .
AMERICAN MATHEMATICAL MONTHLY, 1982, 89 (05) :314-&
[5]   IMPROVING THE WORST CASE RUNNING TIME OF THE BOYER-MOORE STRING MATCHING ALGORITHM [J].
GALIL, Z .
COMMUNICATIONS OF THE ACM, 1979, 22 (09) :505-508
[6]   A NEW PROOF OF THE LINEARITY OF THE BOYER-MOORE STRING SEARCHING ALGORITHM [J].
GUIBAS, LJ ;
ODLYZKO, AM .
SIAM JOURNAL ON COMPUTING, 1980, 9 (04) :672-682
[7]   PRACTICAL FAST SEARCHING IN STRINGS [J].
HORSPOOL, RN .
SOFTWARE-PRACTICE & EXPERIENCE, 1980, 10 (06) :501-506
[8]  
Knuth D. E., 1977, SIAM Journal on Computing, V6, P323, DOI 10.1137/0206024
[9]   WORST-CASE BEHAVIOR OF STRING-SEARCHING ALGORITHMS [J].
RIVEST, RL .
SIAM JOURNAL ON COMPUTING, 1977, 6 (04) :669-674
[10]   A CORRECT PREPROCESSING ALGORITHM FOR BOYER-MOORE STRING-SEARCHING [J].
RYTTER, W .
SIAM JOURNAL ON COMPUTING, 1980, 9 (03) :509-512