THE LONGEST COMMON SUBSEQUENCE PROBLEM REVISITED

被引：123

作者：

APOSTOLICO, A

GUERRA, C

机构：

来源：

关键词：

D O I：

10.1007/BF01840365

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：315 / 336

页数：22

共 17 条

[1]

Aho A., 1976, DESIGN ANAL COMPUTER

[2]

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

APOSTOLICO, A .

[4]

APOSTOLICO A, 1985, 23RD P ALL C MONT, P76

[5]

Bentley J. L., 1976, Information Processing Letters, V5, P82, DOI 10.1016/0020-0190(76)90071-5

[6] FAST MERGING ALGORITHM [J].

BROWN, MR ;

TARJAN, RE .

[7]

BROWN MR, 1978, 10TH P STOC SAN DIEG, P19

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

HIRSCHBERG, DS .

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

HIRSCHBERG, DS .

[10] NEW ALGORITHMS FOR THE LCS PROBLEM [J].

HSU, WJ ;

DU, MW .