On left and right seeds of a string

Authors:
Michalis Christou;Maxime Crochemore;Ondrej Guth;Costas S. Iliopoulos;Solon P. Pissis
Affiliations:
Kings College London, Dept. of Informatics, UK;Kings College London, Dept. of Informatics, UK and Université Paris-Est, France;Czech Technical University in Prague, Faculty of Information Technology, Dept. of Theoretical Computer Science, Czech Republic;Kings College London, Dept. of Informatics, UK and Curtin University, Digital Ecosystems & Business Intelligence Institute, Center for Stringology & Applications, Australia;Kings College London, Dept. of Informatics, UK
Venue:
Journal of Discrete Algorithms
Year:
2012

Citing 11
Cited 1

Optimal superprimitivity testing for strings

Information Processing Letters
An on-line string superprimitivity test

Information Processing Letters
An optimal algorithm to compute all the covers of a string

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

Information and Computation
A work-time optimal algorithm for computing all string covers

Theoretical Computer Science
Border array on bounded alphabet

Journal of Automata, Languages and Combinatorics
Algorithms on Strings

Algorithms on Strings
Efficient seeds computation revisited

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
On the right-seed array of a string

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A linear time algorithm for seeds computation

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

Overlapping repetitions in weighted sequence

Proceedings of the CUBE International Information Technology Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of finding the repetitive structure of a given string y of length n. A factor u of y is a cover of y, if every letter of y lies within some occurrence of u in y. A string v is a seed of y, if it is a cover of a superstring of y. A left seed of y is a prefix of y, that is a cover of a superstring of y. Similarly, a right seed of y is a suffix of y, that is a cover of a superstring of y. An integer array LS is the minimal left-seed (resp. maximal left-seed) array of y, if LS[i] is the minimal (resp. maximal) length of left seeds of y[0..i]. The minimal right-seed (resp. maximal right-seed) arrayRS of y is defined in a similar fashion. In this article, we present linear-time algorithms for computing all left and right seeds of y, a linear-time algorithm for computing the minimal left-seed array of y, a linear-time solution for computing the maximal left-seed array of y, an O(nlogn)-time algorithm for computing the minimal right-seed array of y, and a linear-time solution for computing the maximal right-seed array of y. All algorithms use linear auxiliary space.