1.7.9 Shortest Common Superstring

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A set of strings s_1, ..., s_m .

Problem: Find the shortest string S which contains each s_i as a substring of S .

Implementations

  • CAP -- Contig Assembly Program (C) (rating 8)

    Related Problems

  • Longest Common Substring
  • Suffix Trees and Arrays
  • Text Compression

    Go to the corresponding chapter in the book
    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .