by John on (#79VVG)
A word is universal if it contains every permutation of its alphabet as a subsequence: the letters must appear in order, but gaps are allowed. For example, you can find all six permutations of the digits 1, 2, and 3 inside the string 1231213. Not all permutations can be found as a contiguous substring-that would [...]The post Supersequences and Superpermutations first appeared on John D. Cook.