Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model

13 years 6 months ago

Download www.dcs.kcl.ac.uk

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.

Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayas

Real-time Traffic

Bioinformatics | BIRD 2008 | Graph-theoretic Model | Naive Approach | Swap Matching Problem |

claim paper

» GraphTheoretical Methods in Computer Vision

» Edge Anonymity in Social Network Graphs

» Formulation Schema Matching Problem for Combinatorial Optimization Problem

» Graph model selection using maximum likelihood

» From Entity Relationship to XML Schema A GraphTheoretic Approach

» Dense Nonrigid Surface Registration Using HighOrder Graph Matching

» Switch Scheduling via Randomized Edge Coloring

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	BIRD
Authors	Pavlos Antoniou, Costas S. Iliopoulos, Inuka Jayasekera, M. Sohel Rahman

Comments (0)

Sciweavers

Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model

Bioinformatics | BIRD 2008 | Graph-theoretic Model | Naive Approach | Swap Matching Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers