The DOI matches its Crossref record.
A very fast substring search algorithm
Open accessAbstract
This article describes a substring search algorithm that is faster than the Boyer-Moore algorithm. This algorithm does not depend on scanning the pattern string in any particular order. Three variations of the algorithm are given that use three different pattern scan orders. These include: (1) a “Quick Search” algorithm; (2) a “Maximal Shift” and (3) an “Optimal Mismatch” algorithm.
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
Navarro, G., & Raffinot, M. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9781316135228 · Cited by 291
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
Bernoulli's principle of insufficient reason and conservation of information in computer search
Dembski, W. A., & Marks, R. J. (2009) · 2009 IEEE International Conference on Systems, Man and Cybernetics · doi:10.1109/icsmc.2009.5346119 · Cited by 32
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
Metadata
- Authors
- Sunday, D. M.
- Venue
- Communications of the ACM
- Published
- 1990-08
- Volume
- 33
- Issue
- 8
- Pages
- 132-142
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W1973130965
- Cited by
- 387
- References
- 0
- FWCI
- 5.14
- Type
- journal article
- Language
- en
- Open access
- bronze
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: A very fast substring search algorithm. https://app.cochat.ai/papers/10.1145/79173.79184
- The paper
- Sunday, D. M. (1990). A very fast substring search algorithm. Communications of the ACM. https://doi.org/10.1145/79173.79184
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.
