Paper Info
Title
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.
Year
DOI
Venue
2008
10.1007/978-3-540-70600-7_34
BIOINFORMATICS RESEARCH AND DEVELOPMENT, PROCEEDINGS
Field
DocType
Volume
Graph,Computer science,Theoretical computer science,Cooley–Tukey FFT algorithm,Artificial intelligence,Swap (finance),Pattern matching,Blossom algorithm,Machine learning
Conference
13
ISSN
Citations 
PageRank 
1865-0929
5
0.57
References 
Authors
6
4
Name
Order
Citations
PageRank
Pavlos Antoniou135317.04
Costas S. Iliopoulos21534167.43
Inuka Jayasekera3111.70
M. Sohel Rahman448856.99