APPROXIMATION ALGORITHMS FOR THE SHORTEST COMMON SUPERSTRING PROBLEM

[1] AHO AV, 1982, DATA STRUCTURES ALGO

[2] CHEN MT, 1983, TR129 1283 U ROCH CO

[3] ON FINDING MINIMAL LENGTH SUPERSTRINGS [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 20 (01) : 50 - 58

[4] Gallant J.K., 1982, THESIS PRINCETON U

[5] GINERAS TR, 1979, NUCLEIC ACIDS RES, V7, P529

[6] PATCHING ALGORITHM FOR THE NONSYMMETRIC TRAVELING-SALESMAN PROBLEM [J]. SIAM JOURNAL ON COMPUTING, 1979, 8 (04) : 561 - 573

[7] Lawler E. L., 1986, TRAVELING SALESMAN P

[8] MAIER D, 1977, 233 PRINCETON U

[9] INFORMATION COMPRESSION BY FACTORIZING COMMON STRINGS [J]. COMPUTER JOURNAL, 1975, 18 (02) : 157 - 160

[10] SPACE-ECONOMICAL SUFFIX TREE CONSTRUCTION ALGORITHM [J]. JOURNAL OF THE ACM, 1976, 23 (02) : 262 - 272

[1] AHO AV, 1982, DATA STRUCTURES ALGO

[2] CHEN MT, 1983, TR129 1283 U ROCH CO

[3] ON FINDING MINIMAL LENGTH SUPERSTRINGS [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 20 (01) : 50 - 58

[4] Gallant J.K., 1982, THESIS PRINCETON U

[5] GINERAS TR, 1979, NUCLEIC ACIDS RES, V7, P529

[6] PATCHING ALGORITHM FOR THE NONSYMMETRIC TRAVELING-SALESMAN PROBLEM [J]. SIAM JOURNAL ON COMPUTING, 1979, 8 (04) : 561 - 573

[7] Lawler E. L., 1986, TRAVELING SALESMAN P

[8] MAIER D, 1977, 233 PRINCETON U

[9] INFORMATION COMPRESSION BY FACTORIZING COMMON STRINGS [J]. COMPUTER JOURNAL, 1975, 18 (02) : 157 - 160

[10] SPACE-ECONOMICAL SUFFIX TREE CONSTRUCTION ALGORITHM [J]. JOURNAL OF THE ACM, 1976, 23 (02) : 262 - 272