GENERALIZED STRING MATCHING

被引：207

作者：

ABRAHAMSON, K

机构：

[1] Univ of British Columbia, Vancouver,, BC, Can, Univ of British Columbia, Vancouver, BC, Can

来源：

SIAM JOURNAL ON COMPUTING | 1987年 / 16卷 / 06期

关键词：

REGULAR EXPRESSIONS - STRING MATCHING - TIME-SPACE TRADEOFF;

D O I：

10.1137/0216067

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

(Edited Abstract)

引用

页码：1039 / 1051

页数：13

共 13 条

[1]

Abrahamson K., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P402, DOI 10.1109/SFCS.1986.58

[2]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[3] EFFICIENT STRING MATCHING - AID TO BIBLIOGRAPHIC SEARCH [J].

AHO, AV ;

CORASICK, MJ .

COMMUNICATIONS OF THE ACM, 1975, 18 (06) :333-340

[4] A TIME-SPACE TRADEOFF FOR SORTING ON NON-OBLIVIOUS MACHINES [J].

BORODIN, A ;

FISCHER, MJ ;

KIRKPATRICK, DG ;

LYNCH, NA ;

TOMPA, M .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1981, 22 (03) :351-364

[5]

BORODIN A, 1980, 12TH P ANN ACM S THE, P294

[6] FAST STRING SEARCHING ALGORITHM [J].

BOYER, RS ;

MOORE, JS .

COMMUNICATIONS OF THE ACM, 1977, 20 (10) :762-772

[7]

Fischer M.J., 1974, SIAM AMS P, V7, P113

[8]

GALIL Z, 1981, 13TH P ACM S THEOR C, P106

[9]

Knuth D. E., 1977, SIAM Journal on Computing, V6, P323, DOI 10.1137/0206024

[10] EFFICIENT STRING MATCHING WITH K-MISMATCHES [J].

LANDAU, GM ;

VISHKIN, U .

THEORETICAL COMPUTER SCIENCE, 1986, 43 (2-3) :239-249

← 1 2 →