Efficient string matching: an aid to bibliographic search

@article{Aho1975EfficientSM,
  title={Efficient string matching: an aid to bibliographic search},
  author={A. Aho and Margaret J. Corasick},
  journal={Commun. ACM},
  year={1975},
  volume={18},
  pages={333-340}
}
  • A. Aho, Margaret J. Corasick
  • Published 1975
  • Computer Science
  • Commun. ACM
  • This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text. The algorithm consists of constructing a finite state pattern matching machine from the keywords and then using the pattern matching machine to process the text string in a single pass. Construction of the pattern matching machine takes time proportional to the sum of the lengths of the keywords. The number of state transitions made by the pattern matching… CONTINUE READING

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Algorithms for Finding Patterns in Strings
    • 431
    A new approach to text searching
    • 447
    • Open Access
    Fast Pattern Matching in Strings
    • 2,873
    • Open Access
    On-line construction of suffix trees
    • 923
    • Open Access
    A Method for Improving String Pattern Matching Machines
    • 31
    A guided tour to approximate string matching
    • 2,300
    • Open Access
    A FAST ALGORITHM FOR MULTI-PATTERN SEARCHING
    • 552
    A fast string searching algorithm
    • 2,354
    • Open Access
    Approximate string matching: a simpler faster algorithm
    • 111
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-2 OF 2 REFERENCES
    Fast Pattern Matching in Strings
    • 2,873
    • Highly Influential
    • Open Access
    A system for typesetting mathematics
    • 128
    • Highly Influential