The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Efficient randomized pattern-matching algorithms
Abstract
We present randomized algorithms to solve the following string-matching problem and some of its generalizations: Given a string X of length n (the pattern) and a string Y (the text), find the first occurrence of X as a consecutive block within Y. The algorithms represent strings of length n by much shorter strings called fingerprints, and achieve their efficiency by manipulating fingerprints instead of longer strings. The algorithms require a constant number of storage locations, and essentially run in real time. They are conceptually simple and easy to implement. The method readily generalizes to higher-dimensional pattern-matching problems.
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
Fast Pattern Matching in Strings
Knuth, D. E., Morris, Jr., & Pratt, V. R. (1977) · SIAM Journal on Computing · doi:10.1137/0206024 · Cited by 2,936
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
Approximate formulas for some functions of prime numbers
Rosser, J. B., & Schoenfeld, L. (1962) · Illinois Journal of Mathematics · doi:10.1215/ijm/1255631807 · Cited by 1,546
Probabilistic algorithm for testing primality
Rabin, M. O. (1980) · Journal of Number Theory · doi:10.1016/0022-314x(80)90084-0 · Cited by 863
Self-citationA Fast Monte-Carlo Test for Primality
Solovay, R., & Strassen, V. (1977) · SIAM Journal on Computing · doi:10.1137/0206006 · Cited by 635
Rapid 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
Self-citationSaving Space in Fast String-Matching
Galil, Z., & Seiferas, J. (1980) · SIAM Journal on Computing · doi:10.1137/0209032 · Cited by 30
Cited by
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
The PARSEC benchmark suite: characterization and architectural implications
Bienia, C., Kumar, S., Singh, J. P., & Li, K. (2008) · Proceedings of the 17th international conference on Parallel architectures and compilation techniques · doi:10.1145/1454115.1454128 · Cited by 3,444
Schleimer, S., S, W. D., & Aiken, A. (2003) · Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data · doi:10.1145/872757.872770 · Cited by 1,099
STAMP: Stanford Transactional Applications for Multi-Processing
Minh, C. C., Chung, J., Kozyrakis, C., & Olukotun, K. (2008) · 2008 IEEE International Symposium on Workload Characterization · doi:10.1109/iiswc.2008.4636089 · Cited by 873
Accurate, scalable in-network identification of p2p traffic using application signatures
Sen, S., Spatscheck, O., & Wang, D. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988742 · Cited by 807
Comparison and Evaluation of Clone Detection Tools
Bellon, S., Koschke, R., Antoniol, G., Krinke, J., & Merlo, E. (2007) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2007.70725 · Cited by 782
Approximate string-matching with q-grams and maximal matches
Ukkonen, E. (1992) · Theoretical Computer Science · doi:10.1016/0304-3975(92)90143-4 · Cited by 605
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
Finding Plagiarisms among a Set of Programs with JPlag
Malpohl, G., Prechelt, L., & Philippsen, M. (2002) · Verlag der Technischen Universität Graz · doi:10.3217/jucs-008-11-1016 · Cited by 56
Designing programs that check their work
Blum, M., & Kannan, S. (1995) · Journal of the ACM · doi:10.1145/200836.200880 · Cited by 393
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 Poly1305-AES Message-Authentication Code
Bernstein, D. J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11502760_3 · Cited by 362
GapFiller: a de novo assembly approach to fill the gap within paired reads
Nadalin, F., Vezzi, F., & Policriti, A. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-s14-s8 · Cited by 352
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
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
Clone Detection Using Abstract Syntax Suffix Trees
Koschke, R., Falke, R., & Frenzel, P. (2006) · 2006 13th Working Conference on Reverse Engineering · doi:10.1109/wcre.2006.18 · Cited by 314
Recent Named Entity Recognition and Classification techniques: A systematic review
Goyal, A., Gupta, V., & Kumar, M. (2018) · Computer Science Review · doi:10.1016/j.cosrev.2018.06.001 · Cited by 309
YAP3: improved detection of similarities in computer program and other texts
Wise, M. J. (1996) · Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education · doi:10.1145/236452.236525 · Cited by 294
Navarro, G., & Raffinot, M. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9781316135228 · Cited by 291
Grune, D., & Jacobs, C. J. H. (2008) · Monographs in Computer Science · doi:10.1007/978-0-387-68954-8 · Cited by 290
Designing programs that check their work
Blum, M., & Kanna, S. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73015 · Cited by 287
Smartly Handling Renewable Energy Instability in Supporting A Cloud Datacenter
Gao, J., Wang, H., & Shen, H. (2020) · 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps47924.2020.00084 · Cited by 272
JPlag: finding plagiarisms among a set of programs
Prechelt, L., Malpohl, G., & Philippsen, M. (2000) · Karlsruhe · doi:10.5445/ir/542000 · Cited by 144
“This impressive improvement is achieved by an idea from the Karp-Rabin algorithm [8].”
MethodTechnology dictates algorithms: recent developments in read alignment
Alser, M., Rotman, J., Deshpande, D., Taraszka, K., Shi, H., Baykal, P. I., Yang, H. T., Xue, V., Knyazev, S., Singer, B. D., et al. (2021) · Genome Biology · doi:10.1186/s13059-021-02443-7 · Cited by 144
Disk scrubbing in large archival storage systems
Schwarz, T. J. E., Xin, Q., Miller, E. L., Long, D. D. E., Hospodor, A., & Ng, S. (2004) · The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings. · doi:10.1109/mascot.2004.1348296 · Cited by 128
Academic Source Code Plagiarism Detection by Measuring Program Behavioral Similarity
Cheers, H., Lin, Y., & Smith, S. P. (2021) · IEEE Access · doi:10.1109/access.2021.3069367 · Cited by 59
“Rabin Greedy-String-Tiling algorithm [45] where tokens from one file are covered over another within a tolerance of mismatch.”
Automatic Source Code Plagiarism Detection
Kustanto, C., & Liem, I. (2009) · 2009 10th ACIS International Conference on Software Engineering, Artificial Intelligences, Networking and Parallel/Distributed Computing · doi:10.1109/snpd.2009.62 · Cited by 58
Detection of Plagiarism in Arabic Documents
Menai, M. E. B. (2012) · International Journal of Information Technology and Computer Science · doi:10.5815/ijitcs.2012.10.10 · Cited by 49
Desktop Tools for Offline Plagiarism Detection in Computer Programs
MOZGOVOY, M. (2006) · Informatics in Education · doi:10.15388/infedu.2006.08 · Cited by 46
APlag: A plagiarism checker for Arabic texts
El Bachir Menai, M., & Bagais, M. (2011) · 2011 6th International Conference on Computer Science & Education (ICCSE) · doi:10.1109/iccse.2011.6028888 · Cited by 25
2L-APD: A Two-Level Plagiarism Detection System for Arabic Documents
(2018) · doi:10.2478/cait-2018-0011 · Cited by 24
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
(2018) · DOAJ (DOAJ: Directory of Open Access Journals) · Cited by 5
Metadata
- Authors
- Karp, R. M., & Rabin, M. O.
- Venue
- IBM Journal of Research and Development
- Publisher
- IBM
- Published
- 1987-03
- Volume
- 31
- Issue
- 2
- Pages
- 249-260
- ISSN
- 0018-8646 (ISSN-L)
- OpenAlex
- W1972418517
- Cited by
- 1,269
- References
- 7
- FWCI
- 7.86
- 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.