Computing the Minimum Approximate λ-Cover of a String

摘要

This paper studies the minimum approximate λ-cover problem of a string. Given a string x of length n and an integer λ, the minimum approximate λ-cover problem is to find a set of λ substrings of equal length that covers x with the minimum error, under a variety of distance models including the Hamming distance, the edit distance and the weighted edit distance. We present an algorithm that can solve this problem in polynomial time.