A string matching algorithm fast on the average

Extended abstract
  • Beate Commentz-Walter
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 71)


Search Phase 14th Annual IEEE Symposium String Match Algorithm Letter Comparison Document Letter 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /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. /2/.
    Aho, A.V. and Corasick, M. "Efficient String Matching: An Aid to Bibliographic Search" Com. ACM, June 75, Vol. 18, No. 6Google Scholar
  3. /3/.
    Boyer, R.S. and Moore, J.S. "A Fast String Searching Algorithm" Com. of the ACM, Vol. 20, No. 10, 1977, 262–272Google Scholar
  4. /4/.
    Commentz-Walter, B. "A String Matching Algorithm Fast on the Average" Scientific Center Heidelberg, Technical Report, in print.Google Scholar
  5. /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. /6/.
    Galil, Z. "Saving Space in Fast String-Matching" IBM, Research Rep., RC 6670, 1977 (Yorktown Heights)Google Scholar
  7. /7/.
    Galil, Z. "On Improving the Worst Case Running Time of Boyer-Moore String Matching Algorithm" Automata, Languages and Programming, 5th Colloquium EATCS, July 1978Google Scholar
  8. /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, 1977Google Scholar
  9. /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, 1977Google Scholar
  10. /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–350Google Scholar
  11. /11/.
    McCreight, E.M. "A Space Economical Suffix Tree Construction Algorithm" Journal of the ACM, Vol. 23, No. 2, 1976, 262–272Google Scholar
  12. /12/.
    Scheck, H.-J. "The Reference String Indexing Method" Proceedings Information System Methodology, Venice 1978 Lecture Notes in Comp. Sc. 65 Springer Heidelberg 1976Google Scholar
  13. /13/.
    Weiner, P. "Linear Pattern Matching Algorithm" Proceedings 14th Annual IEEE Symposium in Switching and Automata Theory, 1973, 1–11Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Beate Commentz-Walter
    • 1
  1. 1.FB 10 — InformatikUniversitaet des SaarlandesGermany

Personalised recommendations