A FASTER ALGORITHM COMPUTING STRING EDIT DISTANCES

被引：406

作者：

MASEK, WJ ^{[1
]}

PATERSON, MS ^{[1
]}

机构：

[1] UNIV WARWICK,SCH COMP SCI,COVENTRY CV4 7AL,WARWICKSHIRE,ENGLAND

来源：

关键词：

D O I：

10.1016/0022-0000(80)90002-1

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：18 / 31

页数：14

共 8 条

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER
[2] AHO AV, 1976, J ACM, V23, P1, DOI 10.1145/321921.321922
[3] Arlazarov V. Z., 1970, SOV MATH DOKL, V11, P1209
[4] LINEAR SPACE ALGORITHM FOR COMPUTING MAXIMAL COMMON SUBSEQUENCES
HIRSCHBERG, DS
[J]. COMMUNICATIONS OF THE ACM, 1975, 18 (06) : 341 - 343
[5] Hopcroft J, 1975, 16 ANN S FDN COMP SC, P57
[6] LOWRANCE R, 1975, J ACM, V22, P177, DOI 10.1145/321879.321880
[7] STRING-TO-STRING CORRECTION PROBLEM
WAGNER, RA
FISCHER, MJ
[J]. JOURNAL OF THE ACM, 1974, 21 (01) : 168 - 173
[8] BOUNDS FOR STRING EDITING PROBLEM
WONG, CK
CHANDRA, AK
[J]. JOURNAL OF THE ACM, 1976, 23 (01) : 13 - 16