ON IMPROVING THE AVERAGE CASE OF THE BOYER-MOORE STRING MATCHING ALGORITHM.

被引：0

作者：

Zhu Rui Feng ^{[1
]}

Takaoka, Tadao ^{[1
]}

机构：

[1] Ibaraki Univ, Hitachi, Jpn, Ibaraki Univ, Hitachi, Jpn

来源：

Journal of information processing | 1987年 / 10卷 / 03期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：173 / 177

共 50 条

[1] IMPROVING THE WORST CASE RUNNING TIME OF THE BOYER-MOORE STRING MATCHING ALGORITHM
GALIL, Z
COMMUNICATIONS OF THE ACM, 1979, 22 (09) : 505 - 508
[2] Average case analysis of the Boyer-Moore algorithm
Tsai, Tsung-Hsi
RANDOM STRUCTURES & ALGORITHMS, 2006, 28 (04) : 481 - 498
[3] APPROXIMATE BOYER-MOORE STRING MATCHING
TARHIO, J
UKKONEN, E
SIAM JOURNAL ON COMPUTING, 1993, 22 (02) : 243 - 260
[4] Composite string matching algorithm based on boyer-moore method
Huang, Wenqi
Xiong, Zhengda
Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2009, 37 (12): : 48 - 51
[5] BOYER-MOORE APPROACH TO APPROXIMATE STRING MATCHING
TARHIO, J
UKKONEN, E
LECTURE NOTES IN COMPUTER SCIENCE, 1990, 447 : 348 - 359
[6] TIGHT BOUNDS ON THE COMPLEXITY OF THE BOYER-MOORE STRING-MATCHING ALGORITHM
COLE, R
SIAM JOURNAL ON COMPUTING, 1994, 23 (05) : 1075 - 1091
[7] On obtaining the Boyer-Moore string-matching algorithm by partial evaluation
Danvy, Olivier
Rohde, Henning Korsholm
INFORMATION PROCESSING LETTERS, 2006, 99 (04) : 158 - 162
[8] Approximate Boyer-Moore String Matching for Small Alphabets
Leena Salmela
Jorma Tarhio
Petri Kalsi
Algorithmica, 2010, 58 : 591 - 609
[9] Approximate Boyer-Moore String Matching for Small Alphabets
Salmela, Leena
Tarhio, Jorma
Kalsi, Petri
ALGORITHMICA, 2010, 58 (03) : 591 - 609
[10] Left-to-right preprocessing computation for the Boyer-Moore string matching algorithm
Ibaraki Univ, Ibaraki, Japan
Comput J, 5 (413-416):

← 1 2 3 4 5 →