Approximate swap and mismatch edit distance

Yair Dombb, Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tsur

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

There is no known algorithm that solves the general case of the Approximate Edit Distance problem, where the edit operations are: insertion, deletion, mismatch, and swap, in time o(nm), where n is the length of the text and m is the length of the pattern. In the effort to study this problem, the edit operations were analyzed independently. Karloff [10] showed an algorithm that approximates the edit distance problem with only the mismatch operation in time O(1/ε2n log3 m). Amir et. al. [3] showed that if the only edit operations allowed are swap and mismatch, then the exact edit distance problem can be solved in time O(n√m log m). In this paper, we discuss the problem of approximate edit distance with swap and mismatch. We show a randomized O(1/ε3n log n log3 m) time algorithm for the problem. The algorithm guarantees an approximation factor of (1 + ε) with probability of at least 1 - 1/n.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 14th International Symposium, SPIRE 2007, Proceedings
PublisherSpringer Verlag
Pages149-163
Number of pages15
ISBN (Print)9783540755296
DOIs
StatePublished - 2007
Event14th International Symposium on String Processing and Information Retrieval, SPIRE 2007 - Santiago, Chile
Duration: 29 Oct 200731 Oct 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4726 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Symposium on String Processing and Information Retrieval, SPIRE 2007
Country/TerritoryChile
CitySantiago
Period29/10/0731/10/07

Fingerprint

Dive into the research topics of 'Approximate swap and mismatch edit distance'. Together they form a unique fingerprint.

Cite this