Efficient Data Structures for the Factor Periodicity Problem

We present several efficient data structures for answering queries related to periods in words. For a given word w of length n the Period Query given a factor of w (represented by an interval) returns its shortest period and a compact representation of all periods. Several algorithmic solutions are proposed that balance the data structure space (ranging from O(n) to O(nlogn)), and the query time complexity (ranging from O(log1+en) to O(logn)).

[1]  Moshe Lewenstein,et al.  Dynamic weighted ancestors , 2007, SODA '07.

[2]  H. Wilf,et al.  Uniqueness theorems for periodic functions , 1965 .

[3]  Gonzalo Navarro,et al.  Sorted Range Reporting , 2012, SWAT.

[4]  Fedor V. Fomin,et al.  Algorithm Theory – SWAT 2012 , 2012, Lecture Notes in Computer Science.

[5]  Wojciech Rytter,et al.  Jewels of stringology : text algorithms , 2002 .

[6]  M. Crochemore,et al.  Algorithms on Strings: Tools , 2007 .

[7]  Maxime Crochemore,et al.  Algorithms on strings , 2007 .

[8]  M. Farach.  Optimal suffix tree construction with large alphabets , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[9]  Wojciech Rytter,et al.  Extracting Powers and Periods in a String from Its Runs Structure , 2010, SPIRE.

[10]  Wojciech Rytter,et al.  Jewels of stringology , 2002 .

[11]  Dan Gusfield.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[12]  Wojciech Rytter,et al.  Tiling Periodicity , 2007, Discret. Math. Theor. Comput. Sci..