Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 2,936

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

Knuth, Donald E., Morris, Jr., James H., Pratt, Vaughan R. · 1977 · SIAM Journal on Computing

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/0206024

Cites

12 of 12 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 12 references

Research works printed but not linked: 13

  1. Beeler M., 1972, HAKMEM
  2. Cook Stephen A., 1972, Information processing 71 (Proc. IFIP Congress, Ljubljana, 1971), Vol. 1: Foundations and systems, 75
  3. 10.1090/S0002-9939-1965-0174934-9 · doi:10.1090/s0002-9939-1965-0174934-9
  4. Fischer Michael J., 1974, Complexity of computation (Proc. SIAM-AMS Appl. Math. Sympos., New York, 1973)
  5. 10.1145/990502.990505 · doi:10.1145/990502.990505
  6. Knuth Donald E., 1973, The art of computer programming. Volume 3
  7. 10.2307/2316275 · doi:10.2307/2316275
  8. Knuth Donald E., 1974, Fast pattern matching in strings
  9. 10.1307/mmj/1028998766 · doi:10.1307/mmj/1028998766
  10. 10.1007/BF01447292 · doi:10.1007/bf01447292
  11. Morris, Jr. J. H., 1970, A linear pattern -matching algorithm
  12. Slisenko A. O., 1973, Trudy Mat. Inst. Steklov., 129
  13. 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

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.