A greedy approximation algorithm for constructing shortest common superstrings

Publisher Website

30 April 1988

journal article
Published by Elsevier in Theoretical Computer Science

Vol. 57 (1), 131-145
https://doi.org/10.1016/0304-3975(88)90167-3

Abstract

No abstract available

Keywords

This publication has 4 references indexed in Scilit:

Optimization of parser tables for portable compilers
ACM Transactions on Programming Languages and Systems, 1984
The greedy travelling salesman's problem
Networks, 1979
Storing a sparse table
Communications of the ACM, 1979
Fast Pattern Matching in Strings
SIAM Journal on Computing, 1977

Cited by 97 articles