A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings

  title={A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings},
  author={Jorma Tarhio and Esko Ukkonen},
  journal={Theor. Comput. Sci.},
An approximation algorithm for the shortest common superstring problem is developed, based on the Knuth-Morris-Pratt string matching procedure and on the greedy heuristics for finding longest Hamiltonian paths in weighted graphs. Given a set R of strings, the algorithm constructs a common superstring for R in O(mn) steps where m is the number of strings in R and n is the total length of these strings. The performance of the algorithm is analyzed in terms of the compression in the common… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
66 Extracted Citations
14 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 66 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 14 references

String compression algorithms

  • J. K. Gallant
  • Ph.D. Thesis, Princeton University,
  • 1982
Highly Influential
4 Excerpts

Jenkyns: The greedy travelling salesman's problem. Networks

  • T A.
  • 1979
Highly Influential
3 Excerpts

Yao : Storing a sparse table

  • R. E. Tarjan, C. A.
  • Comm . ACM
  • 1983

Gallant : String compression algorithms

  • D. S. Johnson
  • 1982

Jenkyns : The greedy travelling salesman ' s problem

  • A. T.
  • Networks
  • 1979

Pratt : Fast pattern matching in strings

  • V.
  • SIAM J . Comput .
  • 1979

Similar Papers

Loading similar papers…