Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ISAAC

2003

Springer

2003

Springer

Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogously deﬁned. First, we prove that there is a language in AC0 such that both Hamming and edit distance to this language are hard to approximate; they cannot be approximated with factor O(n 1 3 − ), for any > 0, unless P = NP (n denotes the length of the input string). Second, we show the parameterized intractability of computing the Hamming distance. We prove that for every t ∈ N there exists a language in AC0 for which computing the Hamming distance is W[t]-hard. Moreover, there is a language in P for which computing the Hamming distance is W[P]-hard. Then we show that the problems of computing the Hamming distance and of computing the edit distance are in some sense equivalent by presenting approximation ratio preserving reductions from the former to the latter and vice versa. Finally, we deﬁne HamP...

Related Content

Added |
07 Jul 2010 |

Updated |
07 Jul 2010 |

Type |
Conference |

Year |
2003 |

Where |
ISAAC |

Authors |
Bodo Manthey, Rüdiger Reischuk |

Comments (0)