On a compact encoding of the swap automaton
New algorithm for the Pattern Matching with Swaps problem. Method based on finite automata and word-level parallelism. We improve over the existing bound in the word-RAM model.
word-level parallelism combinatorial problems string algorithms automata theory