COMPLEXITY OF SOME PROBLEMS ON SUBSEQUENCES AND SUPERSEQUENCES

被引：381

作者：

MAIER, D

机构：

来源：

关键词：

D O I：

10.1145/322063.322075

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：322 / 336

页数：15

共 24 条

[1]

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

[2]

AHO AV, 1974, DESIGN ANALYSIS COMP

[3]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[4]

CHVATAL V, 1972, STANCS72292 STANF U, P26

[5]

CHVATAL V, 1975, STANCS75477 STANF U

[6] COMPUTER AIDS TO PROTEIN SEQUENCE DETERMINATION [J].

DAYHOFF, MO .

[7]

DAYHOFF MO, 1969, SCI AM, V221, P86

[8]

FISCHER MJ, 1974, MAC41 MIT TECH MEM

[9] COMPUTING LENGTH OF LONGEST INCREASING SUBSEQUENCES [J].

FREDMAN, ML .

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

HIRSCHBERG, DS .