The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Fast Pattern Matching in Strings
Abstract
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. The constant of proportionality is low enough to make this algorithm of practical use, and the procedure can also be extended to deal with some more general pattern-matching problems. A theoretical application of the algorithm shows that the set of concatenations of even palindromes, i.e., the language $\{\alpha \alpha ^R\}^*$, can be recognized in linear time. Other algorithms which run even faster on the average are also considered.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Efficient string matching: an aid to bibliographic search
Aho, A. V., & Corasick, M. J. (1975) · Communications of the ACM · doi:10.1145/360825.360855 · Cited by 2,944
Programming Techniques: Regular expression search algorithm
Thompson, K. (1968) · Communications of the ACM · doi:10.1145/363347.363387 · Cited by 854
The art of computer programming. Vol.1: Fundamental algorithms
Knuth, D. E. (1978) · Virtual Defense Library (Ministerio de Defensa) · Cited by 801
Self-citationOn the translation of languages from left to right
Knuth, D. E. (1965) · Information and Control · doi:10.1016/s0019-9958(65)90426-2 · Cited by 780
Self-citationStructured Programming with go to Statements
Knuth, D. E. (1974) · ACM Computing Surveys · doi:10.1145/356635.356640 · Cited by 678
Self-citationRapid identification of repeated patterns in strings, trees and arrays
Karp, R. M., Miller, R. E., & Rosenberg, A. L. (1972) · Proceedings of the fourth annual ACM symposium on Theory of computing - STOC '72 · doi:10.1145/800152.804905 · Cited by 274
The Hardest Context-Free Language
Greibach, S. A. (1973) · SIAM Journal on Computing · doi:10.1137/0202025 · Cited by 186
(2005) · doi:10.1007/0-387-26998-3_1 · Cited by 168
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
Manacher, G. K. (1975) · Journal of the ACM · doi:10.1145/321892.321896 · Cited by 153
Synchronization of binary messages
Gilbert, E. N. (1960) · IEEE Transactions on Information Theory · doi:10.1109/tit.1960.1057587 · Cited by 129
Implementation of the substring test by hashing
Harrison, M. C. (1971) · Communications of the ACM · doi:10.1145/362919.362934 · Cited by 99
Research works printed but not linked: 13
- Beeler M., 1972, HAKMEM
- Cook Stephen A., 1972, Information processing 71 (Proc. IFIP Congress, Ljubljana, 1971), Vol. 1: Foundations and systems, 75
- 10.1090/S0002-9939-1965-0174934-9 · doi:10.1090/s0002-9939-1965-0174934-9
- Fischer Michael J., 1974, Complexity of computation (Proc. SIAM-AMS Appl. Math. Sympos., New York, 1973)
- 10.1145/990502.990505 · doi:10.1145/990502.990505
- Knuth Donald E., 1973, The art of computer programming. Volume 3
- 10.2307/2316275 · doi:10.2307/2316275
- Knuth Donald E., 1974, Fast pattern matching in strings
- 10.1307/mmj/1028998766 · doi:10.1307/mmj/1028998766
- 10.1007/BF01447292 · doi:10.1007/bf01447292
- Morris, Jr. J. H., 1970, A linear pattern -matching algorithm
- Slisenko A. O., 1973, Trudy Mat. Inst. Steklov., 129
- Peter Weiner, Linear pattern matching algorithms, 14th Annual IEEE Symposium on Switching and Automata Theory (Univ. Iowa, Iowa City, Iowa, 1973), IEEE Comput. Soc., Northridge, Calif., 1973, 1–11 MR0441032 · DOI · Paper page
Cited by
A guided tour to approximate string matching
Navarro, G. (2001) · ACM Computing Surveys · doi:10.1145/375360.375365 · Cited by 2,561
A fast string searching algorithm
Boyer, R. S., & Moore, J. S. (1977) · Communications of the ACM · doi:10.1145/359842.359859 · Cited by 2,290
A Space-Economical Suffix Tree Construction Algorithm
McCreight, E. M. (1976) · Journal of the ACM · doi:10.1145/321941.321946 · Cited by 1,511
Efficient randomized pattern-matching algorithms
Karp, R. M., & Rabin, M. O. (1987) · IBM Journal of Research and Development · doi:10.1147/rd.312.0249 · Cited by 1,269
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6287 · Cited by 904
Metadata
- Authors
- Knuth, D. E., Morris, Jr., & Pratt, V. R.
- Venue
- SIAM Journal on Computing
- Published
- 1977-06
- Volume
- 6
- Issue
- 2
- Pages
- 323-350
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W1985108724
- Cited by
- 2,936
- References
- 12
- FWCI
- 29.94
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.