Computing the λ-seeds 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:
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Year:
2006

Citing 6
Cited 5

Optimal superprimitivity testing for strings

Information Processing Letters
An on-line string superprimitivity test

Information Processing Letters
Testing string superprimitivity in parallel

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 subtree max gap problem with application to parallel string covering

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms

Algorithms for Computing the λ-regularities in Strings

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

International Journal of Computer Mathematics
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.00

Visualization

Abstract

We study the λ-seed problem of a string in this paper. Given a string x of length n and an integer λ, the λ-seed problem is to find all the sets of λ substrings of x that cover a superstring of x, assuming that each element of the set is of equal length. We present an efficient algorithm that can compute all the λ-seeds of x in O(n2) time.