1 research outputs found
The Edit Distance to -Subsequence Universality
A word is a subsequence of another word if can be obtained from
by deleting some of its letters. The word with alph is
called -subsequence universal if the set of subsequences of length of
contains all possible words of length over . We propose a
series of efficient algorithms computing the minimal number of edit operations
(insertion, deletion, substitution) one needs to apply to a given word in order
to reach the set of -subsequence universal words