FAST ALGORITHM FOR THE LONGEST-COMMON-SUBSEQUENCE PROBLEM

被引：15

作者：

MUKHOPADHYAY, A

机构：

来源：

关键词：

D O I：

10.1016/0020-0255(80)90025-0

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：69 / 82

页数：14

共 14 条

[1]

AHO AV, 1976, J ACM, V23, P1, DOI 10.1145/321921.321922

[2]

AHO AV, 1974, 15TH P ANN IEEE S SW, P104

[3]

CHVATAL V, 1972, STANCS72292 STANF U, P26

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

HIRSCHBERG, DS .

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

HIRSCHBERG, DS .

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

HUNT, JW ;

SZYMANSKI, TG .

[7]

JENSEN K, 1976, USER MANUAL REPORT

[8]

Knuth D., 1973, ART COMPUTER PROGRAM, V1

[9]

KNUTH DE, 1974, STANCS74440 STANF U

[10] SPELLING CORRECTION IN SYSTEMS PROGRAMS [J].

MORGAN, HL .