Fast Pattern Matching in Strings

Explore this paper's citation graph

Summary

An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings, showing that the set of concatenations of even palindromes, i.e., the language α α ^R^*, can be recognized in linear time.

Type
article
Published
1977-06-01
Cited by
3,290
References
24

Keywords

String searching algorithm, Algorithm, Pattern matching, Mathematics, Matching (statistics)

References

Cited by

Related papers