Skip to main content
Springer Nature Link
Log in

A string matching algorithm fast on the average

Extended abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1979)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 71))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. Aho, A.V., Hopcraft, J. E.and Ullman J.D. "The Design and Analysis of ComputerAlgorithms" Addison-Wesley Publ. Comp. Read. Mass.

    Google Scholar 

  2. Aho, A.V. and Corasick, M. "Efficient String Matching: An Aid to Bibliographic Search" Com. ACM, June 75, Vol. 18, No. 6

    Google Scholar 

  3. Boyer, R.S. and Moore, J.S. "A Fast String Searching Algorithm" Com. of the ACM, Vol. 20, No. 10, 1977, 262–272

    Google Scholar 

  4. Commentz-Walter, B. "A String Matching Algorithm Fast on the Average" Scientific Center Heidelberg, Technical Report, in print.

    Google Scholar 

  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)

    Google Scholar 

  6. Galil, Z. "Saving Space in Fast String-Matching" IBM, Research Rep., RC 6670, 1977 (Yorktown Heights)

    Google Scholar 

  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

    Google Scholar 

  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

    Google Scholar 

  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

    Google Scholar 

  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

    Google Scholar 

  11. McCreight, E.M. "A Space Economical Suffix Tree Construction Algorithm" Journal of the ACM, Vol. 23, No. 2, 1976, 262–272

    Google Scholar 

  12. Scheck, H.-J. "The Reference String Indexing Method" Proceedings Information System Methodology, Venice 1978 Lecture Notes in Comp. Sc. 65 Springer Heidelberg 1976

    Google Scholar 

  13. Weiner, P. "Linear Pattern Matching Algorithm" Proceedings 14th Annual IEEE Symposium in Switching and Automata Theory, 1973, 1–11

    Google Scholar 

Download references

Author information

Author notes

  1. Beate Commentz-Walter

    Present address: IBM-Germany Scientific Center Heidelberg, Tiergartenstrasse 15, D-6900, Heidelberg

Authors and Affiliations

  1. FB 10 — Informatik, Universitaet des Saarlandes, Germany

    Beate Commentz-Walter

Authors
  1. Beate Commentz-Walter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hermann A. Maurer

Rights and permissions

Reprints 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

Publish with us

Policies and ethics