Swap and mismatch edit distance

Amihood Amir, Estrella Eisenberg, Ely Porat

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

10 Scopus citations

Abstract

There is no known algorithm that solves the general case of approximate string matching problem with the extended edit distance, 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 where analysed independently. It turns out that the approximate matching problem with only the mismatch operation can be solved in time O(n√mlogm). If the only edit operation allowed is the swap, then the problem can be solved in time O (n log m log σ), where σ = min(m, |Σ|). In this paper we show that the approximate string matching problem with the swap and mismatch as the edit operations, can be computed in time O(n√m log m).

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsSusanne Albers, Tomasz Radzik
PublisherSpringer Verlag
Pages16-27
Number of pages12
ISBN (Print)3540230254, 9783540230250
DOIs
StatePublished - 2004

Publication series

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

Fingerprint

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

Cite this