TY - GEN
T1 - Approximate swap and mismatch edit distance
AU - Dombb, Yair
AU - Lipsky, Ohad
AU - Porat, Benny
AU - Porat, Ely
AU - Tsur, Asaf
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=38049067735&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-75530-2_14
DO - 10.1007/978-3-540-75530-2_14
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:38049067735
SN - 9783540755296
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 149
EP - 163
BT - String Processing and Information Retrieval - 14th International Symposium, SPIRE 2007, Proceedings
PB - Springer Verlag
T2 - 14th International Symposium on String Processing and Information Retrieval, SPIRE 2007
Y2 - 29 October 2007 through 31 October 2007
ER -