This paper studies the minimum approximate λ-cover problem of a string. Given a string x of length n and an integer A, 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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Guo, Q., Zhang, H., & Iliopoulos, C. S. (2006). Computing the minimum approximate λ-cover of a string. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4209 LNCS, pp. 49–60). Springer Verlag. https://doi.org/10.1007/11880561_5
Mendeley helps you to discover research relevant for your work.