STRUCTURAL-PROPERTIES OF THE STRING STATISTICS PROBLEM

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] OPTIMAL OFF-LINE DETECTION OF REPETITIONS IN A STRING [J]. THEORETICAL COMPUTER SCIENCE, 1983, 22 (03) : 297 - 315

[3] APOSTOLICO A, 1984, RAIRO-INF THEOR APPL, V18, P147

[4] APOSTOLICO A, 1986, SIAM J COMPUT, V15

[5] BOYER RS, 1977, COMM ACM, V20, P323

[6] CROCHEMORE M, 1983, CR ACAD SCI I-MATH, V296, P781

[7] AN OPTIMAL ALGORITHM FOR COMPUTING THE REPETITIONS IN A WORD [J]. INFORMATION PROCESSING LETTERS, 1981, 12 (05) : 244 - 250

[8] GALIL Z, 1978, LECTURE NOTES COMPUT, V62, P241

[9] Knuth D. E., 1977, SIAM Journal on Computing, V6, P323, DOI 10.1137/0206024

[10] LENTIN A, 1967, P U N CAROLINA, P128

[1] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2] OPTIMAL OFF-LINE DETECTION OF REPETITIONS IN A STRING [J]. THEORETICAL COMPUTER SCIENCE, 1983, 22 (03) : 297 - 315

[3] APOSTOLICO A, 1984, RAIRO-INF THEOR APPL, V18, P147

[4] APOSTOLICO A, 1986, SIAM J COMPUT, V15

[5] BOYER RS, 1977, COMM ACM, V20, P323

[6] CROCHEMORE M, 1983, CR ACAD SCI I-MATH, V296, P781

[7] AN OPTIMAL ALGORITHM FOR COMPUTING THE REPETITIONS IN A WORD [J]. INFORMATION PROCESSING LETTERS, 1981, 12 (05) : 244 - 250

[8] GALIL Z, 1978, LECTURE NOTES COMPUT, V62, P241

[9] Knuth D. E., 1977, SIAM Journal on Computing, V6, P323, DOI 10.1137/0206024

[10] LENTIN A, 1967, P U N CAROLINA, P128