Implementation of a swap matching algorithm using a graph theoretic model

Abstract

The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [6] by Iliopoulos et al. In this paper we present a useful application for this algorithm and provide an analysis of its running time with a naive approach through implementation. © Springer-Verlag Berlin Heidelberg 2008.