The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
A new approach to text searching
Open accessAbstract
Approach to earc linString searching is a very important component of many problems, including text editing, bibliographic retrieval, and symbol manipulation.Recent surveys of string searching can be found in [4,18].The string-matching problem consists of finding all occurrences of a pattern of length m in a text of length n.We
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
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
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
Kernighan, B. W., & Ritchie, D. M. (1978) · Cited by 1,857
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
Ritchie, D. M., Johnson, S. C., Lesk, M. E., & Kernighan, B. W. (1983) · Programming Languages · doi:10.1007/978-3-662-09507-2_22 · Cited by 860
Practical fast searching in strings
Horspool, R. N. (1980) · Software: Practice and Experience · doi:10.1002/spe.4380100608 · Cited by 594
Handbook of algorithms and data structures
Gonnet, G. H. (1984) · CERN Document Server (European Organization for Nuclear Research) · Cited by 436
Self-citationA very fast substring search algorithm
Sunday, D. M. (1990) · Communications of the ACM · doi:10.1145/79173.79184 · Cited by 387
Hume, A., & Sunday, D. (1991) · Software: Practice and Experience · doi:10.1002/spe.4380211105 · Cited by 186
Fast and practical approximate string matching
Baeza-Yates, R. A., & Perleberg, C. H. (1992) · Lecture notes in computer science · doi:10.1007/3-540-56024-6_15 · Cited by 109
Self-citationExperiments with a very fast substring search algorithm
Smith, P. D. (1991) · Software Practice and Experience · doi:10.1002/spe.4380211006 · Cited by 61
Text-Retrieval: Theory and Practice
Baeza-Yates, R. A. (1992) · Cited by 57
Self-citation
Cited by
A guided tour to approximate string matching
Navarro, G. (2001) · ACM Computing Surveys · doi:10.1145/375360.375365 · Cited by 2,561
Efficient similarity search in sequence databases
Agrawal, R., Faloutsos, C., & Swami, A. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57301-1_5 · Cited by 1,979
Duplicate Record Detection: A Survey
Elmagarmid, A. K., Ipeirotis, P. G., & Verykios, V. S. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.250581 · Cited by 1,267
Chevreux, B., Pfisterer, T., Drescher, B., Driesel, A. J., Müller, W. E. G., Wetter, T., & Suhai, S. (2004) · Genome Research · doi:10.1101/gr.1917404 · Cited by 1,050
Kalign – an accurate and fast multiple sequence alignment algorithm
Lassmann, T., & Sonnhammer, E. L. (2005) · BMC Bioinformatics · doi:10.1186/1471-2105-6-298 · Cited by 705
Metadata
- Authors
- Baeza-Yates, R., & Gonnet, G. H.
- Venue
- Communications of the ACM
- Published
- 1992-10
- Volume
- 35
- Issue
- 10
- Pages
- 74-82
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W1981409766
- Cited by
- 603
- References
- 13
- FWCI
- 7.60
- 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
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.