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
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
Fast text searching: allowing errors
Wu, S., & Manber, U. (1992) · Communications of the ACM · doi:10.1145/135239.135244 · Cited by 727
Equations and Rewrite Rules: A Survey
Huet, G., & Oppen, D. C. (1980) · Formal Language Theory · doi:10.1016/b978-0-12-115350-2.50017-8 · Cited by 714
Data compression via textual substitution
Storer, J. A., & Szymanski, T. G. (1982) · Journal of the ACM · doi:10.1145/322344.322346 · Cited by 634
A new approach to text searching
Baeza-Yates, R., & Gonnet, G. H. (1992) · Communications of the ACM · doi:10.1145/135239.135243 · Cited by 603
Practical fast searching in strings
Horspool, R. N. (1980) · Software: Practice and Experience · doi:10.1002/spe.4380100608 · Cited by 594
Nussinov, R., Pieczenik, G., Griggs, J. R., & Kleitman, D. J. (1978) · SIAM Journal on Applied Mathematics · doi:10.1137/0135006 · Cited by 587
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586
Wrapper induction: Efficiency and expressiveness
Kushmerick, N. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00100-9 · Cited by 553
Why3 — Where Programs Meet Provers
Filliâtre, J.-C., & Paskevich, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-37036-6_8 · Cited by 538
Social processes and proofs of theorems and programs
De Millo, R. A., Lipton, R. J., & Perlis, A. J. (1979) · Communications of the ACM · doi:10.1145/359104.359106 · Cited by 537
Amortized Computational Complexity
Tarjan, R. E. (1985) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0606031 · Cited by 520
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
Grossi, R., & Vitter, J. S. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539702402354 · Cited by 431
Algorithms for Finding Patterns in Strings
AHO, A. V. (1990) · Algorithms and Complexity · doi:10.1016/b978-0-444-88071-0.50010-2 · Cited by 373
The smallest automation recognizing the subwords of a text
Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M. T., & Seiferas, J. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90157-4 · Cited by 334
Fast parallel and serial approximate string matching
Landau, G. M., & Vishkin, U. (1989) · Journal of Algorithms · doi:10.1016/0196-6774(89)90010-2 · Cited by 328
Large Language Models are Zero-Shot Rankers for Recommender Systems
Hou, Y., Zhang, J., Lin, Z., Lu, H., Xie, R., McAuley, J., & Zhao, W. X. (2024) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-56060-6_24 · Cited by 327
Tutorial notes on partial evaluation
Consel, C., & Danvy, O. (1993) · Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93 · doi:10.1145/158511.158707 · Cited by 316
Navarro, G., & Raffinot, M. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9781316135228 · Cited by 291
A systematic literature review for network intrusion detection system (IDS)
Abdulganiyu, O. H., Ait Tchakoucht, T., & Saheed, Y. K. (2023) · International Journal of Information Security · doi:10.1007/s10207-023-00682-2 · Cited by 279
Discovering relative motion patterns in groups of moving point objects
Laube, P., Imfeld, S., & Weibel, R. (2005) · International Journal of Geographical Information Science · doi:10.1080/13658810500105572 · Cited by 275
The Myriad Virtues of Subword Trees
Apostolico, A. (1985) · Combinatorial Algorithms on Words · doi:10.1007/978-3-642-82456-2_6 · Cited by 274
Hazay, C., & Lindell, Y. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78524-8_10 · Cited by 267
Battle, M. A., Konopka, G., Parviz, F., Gaggl, A. L., Yang, C., Sladek, F. M., & Duncan, S. A. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0600246103 · Cited by 246
Occam's razor in metacomputation: the notion of a perfect process tree
Glück, R., & Klimov, A. V. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57264-3_34 · Cited by 106
Controlling generalization and polyvariance in partial deduction of normal logic programs
Leuschel, M., Martens, B., & De Schreye, D. (1998) · ACM Transactions on Programming Languages and Systems · doi:10.1145/271510.271525 · Cited by 88
Quantum Pattern Matching Fast on Average
Montanaro, A. (2017) · Algorithmica · doi:10.1007/s00453-015-0060-4 · Cited by 84
On-line string matching algorithms: survey and experimental results
Michailidis, P. D., & Margaritis, K. G. (2001) · International Journal of Computer Mathematics · doi:10.1080/00207160108805036 · Cited by 53
Narrowing-driven partial evaluation of functional logic programs
Alpuente, M., Falaschi, M., & Vidal, G. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61055-3_28 · Cited by 40
Innovative Automation Algorithm in Micro-multinational Data-Entry Industry
Faruqui, N., Yousuf, M. A., Chakraborty, P., & Hossain, M. S. (2020) · Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-030-52856-0_54 · Cited by 21
Longest Gapped Repeats and Palindromes
Dumitran, M., Gawrychowski, P., & Manea, F. (2017) · Discrete Mathematics & Theoretical Computer Science · doi:10.23638/dmtcs-19-4-4 · Cited by 11
Widaningrum, I., Mustikasari, D., Arifin, R., & Pratiwi, H. A. (2020) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/1517/1/012093 · Cited by 6
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.