Structural Properties of the String Statistics Problem

[1]  Raffaele Giancarlo,et al.  The Boyer-Moore-Galil String Searching Strategies Revisited , 1986, SIAM J. Comput..

[2]  Z. Galil,et al.  Combinatorial Algorithms on Words , 1985 .

[3]  Alberto Apostolico,et al.  The Myriad Virtues of Subword Trees , 1985 .

[4]  Michael G. Main,et al.  An O(n log n) Algorithm for Finding All Repetitions in a String , 1984, J. Algorithms.

[5]  Alberto Apostolico,et al.  On Context Constrained Squares and Repetitions in a String , 1984, RAIRO Theor. Informatics Appl..

[6]  Franco P. Preparata,et al.  Optimal Off-Line Detection of Repetitions in a String , 1983, Theor. Comput. Sci..

[7]  Maxime Crochemore,et al.  An Optimal Algorithm for Computing the Repetitions in a Word , 1981, Inf. Process. Lett..

[8]  Mila E. Majster.  Efficient On-Line Construction and Correction of Position Trees , 1980 .

[9]  Zvi Galil,et al.  On improving the worst case running time of the Boyer-Moore string matching algorithm , 1978, CACM.

[10]  Robert S. Boyer,et al.  A fast string searching algorithm , 1977, CACM.

[11]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[12]  Edward M. McCreight,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[13]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[14]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[15]  M. Schützenberger,et al.  The equation $a^M=b^Nc^P$ in a free group. , 1962 .

[16]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .