→Superstring: suggest to reorder: definition, nontrivial example, shorter example, interest in short superstrings, trivial superstring (was mentioned twice)
Given a set of <math>k</math> strings <math>P = \{s_1,s_2,s_3,\dots s_k\}</math>, aA '''superstring''' of thea finite set <math>P</math> of strings is a single string that contains every string in <math>P</math> as a substring. For example, <math>\text{bcclabccefab}</math> is a superstring of <math>P = \{\text{abcc}, \text{efab}, \text{bccla}\}</math>, and <math>\text{efabccla}</math> is a shorter one. Generally, one is interested in finding superstrings whose length is as small as possible;{{Clarify|reason=why are we interested in them?|date=June 2010}} a concatenation of all strings of <math>P</math> in any order gives a trivial superstring of <math>P</math>.
