FAST PARALLEL AND SERIAL APPROXIMATE STRING MATCHING

被引：181

作者：

LANDAU, GM

VISHKIN, U

机构：

[1] TEL AVIV UNIV,SACKLER FAC EXACT SCI,SCH MATH SCI,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAEL

[2] NYU,COURANT INST MATH SCI,DEPT COMP SCI,NEW YORK,NY 10003

来源：

JOURNAL OF ALGORITHMS | 1989年 / 10卷 / 02期

关键词：

D O I：

10.1016/0196-6774(89)90010-2

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：157 / 169

页数：13

相关论文

共 23 条

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER
[2] PARALLEL CONSTRUCTION OF A SUFFIX TREE WITH APPLICATIONS
APOSTOLICO, A
ILIOPOULOS, C
LANDAU, GM
SCHIEBER, B
VISHKIN, U
[J]. ALGORITHMICA, 1988, 3 (03) : 347 - 365
[3] FAST STRING SEARCHING ALGORITHM
BOYER, RS
MOORE, JS
[J]. COMMUNICATIONS OF THE ACM, 1977, 20 (10) : 762 - 772
[4] Chen M.T., 1985, NATO ASI SERIES F, P97
[5] Galil Z., 1986, SIGACT News, V17, P52, DOI 10.1145/8307.8309
[6] PARALLEL STRING MATCHING WITH K-MISMATCHES
GALIL, Z
GIANCARLO, R
[J]. THEORETICAL COMPUTER SCIENCE, 1987, 51 (03) : 341 - 348
[7] OPTIMAL PARALLEL ALGORITHMS FOR STRING MATCHING
GALIL, Z
[J]. INFORMATION AND CONTROL, 1985, 67 (1-3): : 144 - 157
[8] TIME-SPACE-OPTIMAL STRING MATCHING
GALIL, Z
SEIFERAS, J
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1983, 26 (03) : 280 - 294
[9] FAST ALGORITHMS FOR FINDING NEAREST COMMON ANCESTORS
HAREL, D
TARJAN, RE
[J]. SIAM JOURNAL ON COMPUTING, 1984, 13 (02) : 338 - 355
[10] EFFICIENT RANDOMIZED PATTERN-MATCHING ALGORITHMS
KARP, RM
RABIN, MO
[J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1987, 31 (02) : 249 - 260