Computing the Cover Array in Linear Time
暂无分享,去创建一个
[1] Michael G. Main,et al. An O(n log n) Algorithm for Finding All Repetitions in a String , 1984, J. Algorithms.
[2] M. Lothaire. Combinatorics on words: Bibliography , 1997 .
[3] William F. Smyth,et al. An Optimal Algorithm to Compute all the Covers of a String , 1994, Inf. Process. Lett..
[4] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[5] Dany Breslauer,et al. Testing String Superprimitivity in Parallel , 1994, Inf. Process. Lett..
[6] William F. Smyth,et al. A Correction to "An Optimal Algorithm to Compute all the Covers of a String" , 1995, Inf. Process. Lett..
[7] Franco P. Preparata,et al. Optimal Off-Line Detection of Repetitions in a String , 1983, Theor. Comput. Sci..
[8] Ming Gu,et al. An efficient algorithm for dynamic text indexing , 1994, SODA '94.
[9] Costas S. Iliopoulos,et al. Optimal Superprimitivity Testing for Strings , 1991, Inf. Process. Lett..
[10] Dany Breslauer,et al. An On-Line String Superprimitivity Test , 1992, Inf. Process. Lett..
[11] Costas S. Iliopoulos,et al. The subtree max gap problem with application to parallel string covering , 1994, SODA '94.
[12] Andrzej Ehrenfeucht,et al. Efficient Detection of Quasiperiodicities in Strings , 1993, Theor. Comput. Sci..
[13] Costas S. Iliopoulos,et al. On-line algorithms for k-Covering , 1998 .