ALGORITHMS FOR LONGEST COMMON SUBSEQUENCE PROBLEM

被引：461

作者：

HIRSCHBERG, DS ^{[1
]}

机构：

[1] PRINCETON UNIV,PRINCETON,NJ 08540

来源：

关键词：

D O I：

10.1145/322033.322044

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：664 / 675

页数：12

共 23 条

[1]

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

[2]

AHO AV, 1974, DESIGN ANALYSIS COMP

[3]

Arlazarov V. Z., 1970, SOV MATH DOKL, V11, P1209

[4]

CHVATAL V, 1972, STANCS72292 STANF U, P26

[5]

CHVATAL V, 1975, STANCS75477 STANF U

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

HIRSCHBERG, DS .

[7]

HIRSCHBERG DS, 1974, TR156 PRINC U COMPTR

[8]

HIRSCHBERG DS, 1975, THESIS PRINCETON U

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

HUNT, JW ;

SZYMANSKI, TG .

[10]

Knuth, 2010, COMBINATORIAL ALGORI, V4