A permutation subsequence is a collection of elements of a permutation that appear in order in the permutation, although not necessarily contiguously; for this reason, permutation subsequences are analogous to subsequences of strings.