Computing the minimum approximate λ-cover of a string

Authors:
Qing Guo;Hui Zhang;Costas S. Iliopoulos
Affiliations:
Department of Computer Science and Engineering, Zhejiang University, Hangzhou, Zhejiang, China;Department of Computer Science, King’s College London Strand, London, England;Department of Computer Science, King’s College London Strand, London, England
Venue:
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Year:
2006

Citing 5
Cited 0

Optimal superprimitivity testing for strings

Information Processing Letters
An on-line string superprimitivity test

Information Processing Letters
A correction to “An optimal algorithm to compute all the covers of a string”

Information Processing Letters
Approximate periods of strings

Theoretical Computer Science
A Dynamic Edit Distance Table

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.