The Sequence Assembly problem

Problem 5   Given a set of sub-strings, find the minimal string containing all of the members of the set.

Although this problem may seem simple, it is known to be NP-Complete. However, there are greedy algorithms which perform fairly well in practice.