ON FINDING MINIMAL LENGTH SUPERSTRINGS

被引：111

作者：

GALLANT, J

MAIER, D

STORER, JA

机构：

[1] SUNY STONY BROOK, DEPT COMP SCI, STONY BROOK, NY 11790 USA

[2] BELL TEL LABS INC, MURRAY HILL, NJ 07974 USA

来源：

关键词：

D O I：

10.1016/0022-0000(80)90004-5

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：50 / 58

页数：9

共 9 条

[1]

Aho A., 1976, DESIGN ANAL COMPUTER

[2]

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

[3]

Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1

[4]

Harary F., 1972, GRAPH THEORY

[5] A METHOD FOR THE CONSTRUCTION OF MINIMUM-REDUNDANCY CODES [J].

HUFFMAN, DA .

PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1952, 40 (09) :1098-1101

[6]

Karp Richard M., 1972, COMPLEXITY COMPUTER, P85

[7]

Maier D., 1977, 233 PRINC U DEP EL E

[8]

STORER J, 1977, 234 PRINC U DEP EL E

[9]

STORER JA, 1977, 235 PRINC U DEP EL E