SIMPLE AND EFFICIENT STRING MATCHING WITH K MISMATCHES

被引：33

作者：

GROSSI, R

LUCCIO, F

机构：

来源：

关键词：

D O I：

10.1016/0020-0190(89)90188-9

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：113 / 120

页数：8

共 8 条

[1] FAST STRING SEARCHING ALGORITHM
BOYER, RS
MOORE, JS
[J]. COMMUNICATIONS OF THE ACM, 1977, 20 (10) : 762 - 772
[2] Galil Z., 1986, SIGACT News, V17, P52, DOI 10.1145/8307.8309
[3] Galil Z., 1988, Journal of Complexity, V4, P33, DOI 10.1016/0885-064X(88)90008-8
[4] TIME-SPACE-OPTIMAL STRING MATCHING
GALIL, Z
SEIFERAS, J
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1983, 26 (03) : 280 - 294
[5] GALIL Z, 1989, 16TH P ICALP
[6] Knuth D. E., 1977, SIAM Journal on Computing, V6, P323, DOI 10.1137/0206024
[7] FAST STRING MATCHING WITH K-DIFFERENCES
LANDAU, GM
VISHKIN, U
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1988, 37 (01) : 63 - 78
[8] LANDAU GM, 1989, J ALGORITHMS, V10