APPROXIMATION ALGORITHMS FOR THE SHORTEST COMMON SUPERSTRING PROBLEM

被引：57

作者：

TURNER, JS

机构：

来源：

关键词：

D O I：

10.1016/0890-5401(89)90044-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：1 / 20

页数：20

共 16 条

[1]

AHO AV, 1982, DATA STRUCTURES ALGO

[2]

CHEN MT, 1983, TR129 1283 U ROCH CO

[3] ON FINDING MINIMAL LENGTH SUPERSTRINGS [J].

GALLANT, J ;

MAIER, D ;

STORER, JA .

[4]

Gallant J.K., 1982, THESIS PRINCETON U

[5]

GINERAS TR, 1979, NUCLEIC ACIDS RES, V7, P529

KARP, RM .

[7]

Lawler E. L., 1986, TRAVELING SALESMAN P

[8]

MAIER D, 1977, 233 PRINCETON U

[9] INFORMATION COMPRESSION BY FACTORIZING COMMON STRINGS [J].

MAYNE, A ;

JAMES, EB .

[10] SPACE-ECONOMICAL SUFFIX TREE CONSTRUCTION ALGORITHM [J].

MCCREIGHT, EM .