The DOI matches its Crossref record.
Rapid identification of repeated patterns in strings, trees and arrays
Abstract
In this paper we look at a number of matching problems and devise general techniques for attacking such problems. In particular, we describe a strategy for constructing efficient algorithms for solving two types of matching problems. We use this strategy to develop explicit algorithms for these two problems applied to strings (where the patterns are substrings) and arrays (where the patterns are subarrays or blocks). We also develop algorithms for these and related problems for trees, where the patterns are subtrees. Certain special cases of these algorithms are also discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
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
Analyzing the input stream for character- level errors in unconstrained text entry evaluations
Wobbrock, J. O., & Myers, B. A. (2006) · ACM Transactions on Computer-Human Interaction · doi:10.1145/1188816.1188819 · Cited by 200
Metadata
- Authors
- Karp, R. M., Miller, R. E., & Rosenberg, A. L.
- Venue
- Proceedings of the fourth annual ACM symposium on Theory of computing - STOC '72
- Publisher
- ACM Press
- Published
- 1972
- Pages
- 125-136
- OpenAlex
- W2434820933
- Cited by
- 274
- References
- 0
- FWCI
- 0.67
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Rapid identification of repeated patterns in strings, trees and arrays. https://app.cochat.ai/papers/10.1145/800152.804905
- The paper
- Karp, R. M., Miller, R. E., & Rosenberg, A. L. (1972). Rapid identification of repeated patterns in strings, trees and arrays. Proceedings of the fourth annual ACM symposium on Theory of computing - STOC '72. https://doi.org/10.1145/800152.804905
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.
