GENERALIZED STRING MATCHING

[1] Abrahamson K., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P402, DOI 10.1109/SFCS.1986.58

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

[3] EFFICIENT STRING MATCHING - AID TO BIBLIOGRAPHIC SEARCH [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (06) : 333 - 340

[4] A TIME-SPACE TRADEOFF FOR SORTING ON NON-OBLIVIOUS MACHINES [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1981, 22 (03) : 351 - 364

[5] BORODIN A, 1980, 12TH P ANN ACM S THE, P294

[6] FAST STRING SEARCHING ALGORITHM [J]. COMMUNICATIONS OF THE ACM, 1977, 20 (10) : 762 - 772

[7] Fischer M.J., 1974, SIAM AMS P, V7, P113

[8] GALIL Z, 1981, 13TH P ACM S THEOR C, P106

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

[10] EFFICIENT STRING MATCHING WITH K-MISMATCHES [J]. THEORETICAL COMPUTER SCIENCE, 1986, 43 (2-3) : 239 - 249

[1] Abrahamson K., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P402, DOI 10.1109/SFCS.1986.58

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

[3] EFFICIENT STRING MATCHING - AID TO BIBLIOGRAPHIC SEARCH [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (06) : 333 - 340

[4] A TIME-SPACE TRADEOFF FOR SORTING ON NON-OBLIVIOUS MACHINES [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1981, 22 (03) : 351 - 364

[5] BORODIN A, 1980, 12TH P ANN ACM S THE, P294

[6] FAST STRING SEARCHING ALGORITHM [J]. COMMUNICATIONS OF THE ACM, 1977, 20 (10) : 762 - 772

[7] Fischer M.J., 1974, SIAM AMS P, V7, P113

[8] GALIL Z, 1981, 13TH P ACM S THEOR C, P106

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

[10] EFFICIENT STRING MATCHING WITH K-MISMATCHES [J]. THEORETICAL COMPUTER SCIENCE, 1986, 43 (2-3) : 239 - 249