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
The subtree max gap problem with application to parallel string covering
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Reconstructing Strings from Substrings (Extended Abstract)
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Computing the λ-covers of a string
Information Sciences: an International Journal
Computing the λ-seeds of a string
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Hi-index | 0.00 |
We introduce the notion of λ-regularities in strings that consist of λ-covers and λ-seeds, and study three λ-regularities problems - the λ-cover problem, the general λ-cover problem and the λ-seed problem in this paper. λ-regularities can be viewed as generalized string regularities in the sense that a set of λ repetitive strings rather than a single repeated string are considered. We first present a general algorithm for computing all the λ-combinations of a given string, since they serve as candidates for both λ-covers and λ-seeds. The running time of this algorithm is O(n$^2$). Relying on this result, we answer the above mentioned three problems all in O(n$^2$) time.