Applications of single-operator edit distances for permuted sequences

In this paper we consider single-operator distance functions for comparing sequences/strings that are equivalent up to permutation. It is shown that these distance functions admit smaller backtrace expressions than conventional edit distance. Results are provided showing that this reduced backtrace complexity can be exploited for data compression and post-analysis modeling of packet delays in a communications network application.