Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model

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.

• Type: Conference
• Year: 2008
• Where: BIRD
• Authors: Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayasekera, M. Sohel Rahman
• Keywords: Bioinformatics, BIRD 2008, Graph-theoretic Model, Naive Approach, Swap Matching Problem