A Minimal Periods Algorithm with Applications

Details A Minimal Periods Algorithm with Applications A Minimal Periods Algorithm with Applications

2009-11-17

arxiv.org/abs/0911.3355v1

Computer Science

Data Structures and Algorithms

14 pages

Scientific paper

Kosaraju in ``Computation of squares in a string'' briefly described a linear-time algorithm for computing the minimal squares starting at each position in a word. Using the same construction of suffix trees, we generalize his result and describe in detail how to compute in O(k|w|)-time the minimal k-th power, with period of length larger than s, starting at each position in a word w for arbitrary exponent $k\geq2$ and integer $s\geq0$. We provide the complete proof of correctness of the algorithm, which is somehow not completely clear in Kosaraju's original paper. The algorithm can be used as a sub-routine to detect certain types of pseudo-patterns in words, which is our original intention to study the generalization.

Affiliated with

Also associated with

No associations

Rating

A Minimal Periods Algorithm with Applications does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Minimal Periods Algorithm with Applications, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Minimal Periods Algorithm with Applications will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-650981