IMPROVING THE WORST-CASE PERFORMANCE OF THE HUNT-SZYMANSKI STRATEGY FOR THE LONGEST COMMON SUBSEQUENCE OF 2 STRINGS

被引：33

作者：

APOSTOLICO, A

机构：

来源：

关键词：

D O I：

10.1016/0020-0190(86)90044-X

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：63 / 69

页数：7

共 9 条

[1]

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

[2]

APOSTOLICA A, 1985, UNPUB LONGEST COMMON

[3] FAST MERGING ALGORITHM [J].

BROWN, MR ;

TARJAN, RE .

[4]

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

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

HIRSCHBERG, DS .

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

HIRSCHBERG, DS .

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

HUNT, JW ;

SZYMANSKI, TG .

[8]

MEHLHORN K, 1984, EATCS MONOGRAPHS THE

[9]

van Emde Boas P., 1977, INFORMATION PROCESSI, V6, P80