THE STRING-TO-STRING CORRECTION PROBLEM WITH BLOCK MOVES

被引：106

作者：

TICHY, WF

机构：

来源：

ACM TRANSACTIONS ON COMPUTER SYSTEMS | 1984年 / 2卷 / 04期

关键词：

D O I：

10.1145/357401.357404

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：309 / 321

页数：13

共 17 条

[1]

GOSLING J, 1981, JUN P ACM SIGPLAN SI, P123

[2] TECHNIQUE FOR ISOLATING DIFFERENCES BETWEEN FILES [J].

HECKEL, P .

[3] ALGORITHMS FOR LONGEST COMMON SUBSEQUENCE PROBLEM [J].

HIRSCHBERG, DS .

[4] LINEAR SPACE ALGORITHM FOR COMPUTING MAXIMAL COMMON SUBSEQUENCES [J].

HIRSCHBERG, DS .

[5] FAST ALGORITHM FOR COMPUTING LONGEST COMMON SUBSEQUENCES [J].

HUNT, JW ;

SZYMANSKI, TG .

[6]

HUNT JW, 1976, 41 ATT BELL LAB COMP

[7]

LEBLANG DB, 1984, SIGPLAN NOTICES, V19, P104, DOI 10.1145/390011.808255

[8]

LOWRANCE R, 1975, J ACM, V22, P177, DOI 10.1145/321879.321880

[9]

Masek W. J., 1983, TIME WARPS STRING ED, P337

[10] SPACE-ECONOMICAL SUFFIX TREE CONSTRUCTION ALGORITHM [J].

MCCREIGHT, EM .