Computing the λ-covers of a string

Authors:
Qing Guo;Hui Zhang;Costas S. Iliopoulos
Affiliations:
Department of Computer Science and Engineering, Zhejiang University, Hangzhou, Zhejiang 310027, China;Department of Computer Science, King's College London Strand, London WC2R 2LS, England, United Kingdom;Department of Computer Science, King's College London Strand, London WC2R 2LS, England, United Kingdom
Venue:
Information Sciences: an International Journal
Year:
2007

Citing 7
Cited 7

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
A work-time optimal algorithm for computing all string covers

Theoretical Computer Science
The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications

Fundamenta Informaticae
PPM with the extended alphabet

Information Sciences: an International Journal
Property matching and weighted matching

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching

Algorithms for Computing the λ-regularities in Strings

Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Generalized approximate regularities in strings

International Journal of Computer Mathematics
Varieties of regularities in weighted sequences

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
New complexity results for the k-covers problem

Information Sciences: an International Journal
A linear time algorithm for seeds computation

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Algorithms for Computing the λ-regularities in Strings

Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Computing regularities in strings: A survey

European Journal of Combinatorics

Quantified Score

Hi-index	0.07

Visualization

Abstract

Given a string x of length n and an integer constant @l, the @l-Cover Problem is defined to be the identification of all the sets of @l substrings each of equal length that cover x. This problem can be solved by a general algorithm in O(n^2) time for constant alphabet size. We also generalize the @l-Cover Problem, whereby a set of @l substrings of different lengths are considered, which can be computed using the general algorithm in O(n^2) time.