A string matching algorithm fast on the average

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 71 LNCS, Issue , 1979, Pages 118-132

  Commentz Walter, Beate ^a,b  

^a FB I0 – Informatik Universitaet des Saarlandes ^*  (Germany)

^b IBM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976228809     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-09510-1_10     Document Type: Conference Paper

References (13)

1. Aho, A.V., Hopcraft, J. E. and Ullman J.D. "The Design and Analysis of ComputerAlgorithms" Addison-Wesley Publ. Comp. Read. Mass.
2. Aho, A.V. and Corasick, M. "Efficient String Matching: An Aid to Bibliographic Search" Com. ACM, June 75, Vol. 18, No. 6
3. Boyer, R.S. and Moore, J.S. "A Fast String Searching Algorithm" Com. of the ACM, Vol. 20, No. 10, 1977, 262–272
4. Commentz-Walter, B. "A String Matching Algorithm Fast on the Average" Scientific Center Heidelberg, Technical Report, in print.
5. Fagin, R., Nievergelt, J., Pippenger, N. and Strong, H.R. "Extendible Hashing — A Fast Access Method for Dynamic Files" IBM, Research Rep. RJ 2305, 1978 (San Jose)
6. Galil, Z. "Saving Space in Fast String-Matching" IBM, Research Rep., RC 6670, 1977 (Yorktown Heights)
7. Galil, Z. "On Improving the Worst Case Running Time of Boyer-Moore String Matching Algorithm" Automata, Languages and Programming, 5th Colloquium EATCS, July 1978
8. Guibas, L.J. and Odlyzko, A.M. "A New Proof of the Linearity of the Boyer-Moore String Searching Algorithms" Proceedings 18th Annual IEEE Symposium on Foundations of Computer Science, 1977
9. Guibas, L.J., McCreight, E.M., Plass, M.F. and Roberts, J.R. "A new Representation for Linear Lists" 9th Annual ACM Symposium on Theory of Computing, 1977
10. Knuth, D.E., Morris Jr., J.H. and Pratt, V.B. "Fast Pattern Matching in Strings" SIAM J. on Computing, Vol. 6, No. 2, 1977, 323–350
11. McCreight, E.M. "A Space Economical Suffix Tree Construction Algorithm" Journal of the ACM, Vol. 23, No. 2, 1976, 262–272
12. Scheck, H.-J. "The Reference String Indexing Method" Proceedings Information System Methodology, Venice 1978 Lecture Notes in Comp. Sc. 65 Springer Heidelberg 1976
13. Weiner, P. "Linear Pattern Matching Algorithm" Proceedings 14th Annual IEEE Symposium in Switching and Automata Theory, 1973, 1–11