• We might assist an online aligner by permuting our n segment pairs to place shorter, less ambiguous ones at the top.
we would have to communicate the permutation to the decompressor, at a prohibitive cost of log 2 (n!