For detailed version compare lit (4). The work reported here was done at the Heidelberg Scientific Center of IBM-Germany. It is part of a project dealing with subjects like Automatic Indexing, Clustering, and retrieval structures of unformatted data base.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Literature
Aho, A.V., Hopcraft, J. E.and Ullman J.D. "The Design and Analysis of ComputerAlgorithms" Addison-Wesley Publ. Comp. Read. Mass.
Aho, A.V. and Corasick, M. "Efficient String Matching: An Aid to Bibliographic Search" Com. ACM, June 75, Vol. 18, No. 6
Boyer, R.S. and Moore, J.S. "A Fast String Searching Algorithm" Com. of the ACM, Vol. 20, No. 10, 1977, 262–272
Commentz-Walter, B. "A String Matching Algorithm Fast on the Average" Scientific Center Heidelberg, Technical Report, in print.
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)
Galil, Z. "Saving Space in Fast String-Matching" IBM, Research Rep., RC 6670, 1977 (Yorktown Heights)
Galil, Z. "On Improving the Worst Case Running Time of Boyer-Moore String Matching Algorithm" Automata, Languages and Programming, 5th Colloquium EATCS, July 1978
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
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
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
McCreight, E.M. "A Space Economical Suffix Tree Construction Algorithm" Journal of the ACM, Vol. 23, No. 2, 1976, 262–272
Scheck, H.-J. "The Reference String Indexing Method" Proceedings Information System Methodology, Venice 1978 Lecture Notes in Comp. Sc. 65 Springer Heidelberg 1976
Weiner, P. "Linear Pattern Matching Algorithm" Proceedings 14th Annual IEEE Symposium in Switching and Automata Theory, 1973, 1–11
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Commentz-Walter, B. (1979). A string matching algorithm fast on the average. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_10
Download citation
DOI: https://doi.org/10.1007/3-540-09510-1_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09510-1
Online ISBN: 978-3-540-35168-9
eBook Packages: Springer Book Archive