The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
On-line string matching algorithms: survey and experimental results
Abstract
In this paper we present a short survey and experimental results for well known sequential string matching algorithms. We consider algorithms based on different approaches including classical, suffix automata, bit-parallelism and hashing. We put special emphasis on algorithms recently presented such as Shift-Or and BNDM algorithms. We compare these algorithms in terms of the number of character comparisons and the running time for four different types of text: binary alphabet, alphabet of size 8, English alphabet and DNA alphabet.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Methods of the copying detection include algorithms that can be divided into four subcategories (Aho, 2014; Michailidis & Margaritis, 2001; Stein, 2007; Stein & Zu Eissen, 2006; Stephen, 1992).”
From Taxonomy of academic plagiarism methods (2021) · cites this paper as Michailidis & Margaritis, 2001
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
Kernighan, B. W., & Ritchie, D. M. (1978) · Cited by 1,857
Fast text searching: allowing errors
Wu, S., & Manber, U. (1992) · Communications of the ACM · doi:10.1145/135239.135244 · Cited by 727
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
(1995) · Choice Reviews Online · doi:10.5860/choice.32-5696 · Cited by 582
A very fast substring search algorithm
Sunday, D. M. (1990) · Communications of the ACM · doi:10.1145/79173.79184 · Cited by 387
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
Stephen, G. A. (1994) · Lecture Notes Series on Computing · doi:10.1142/2418 · Cited by 324
Research works printed but not linked: 1
- 10.1002/(SICI)1097-024X(199802)28:2<191::AID-SPE149>3.0.CO;2-2 · doi:10.1002/(sici)1097-024x(199802)28:2<191::aid-spe149>3.0.co;2-2
Cited by
Taxonomy of academic plagiarism methods
Vrbanec, T., & Meštrović, A. (2021) · Zbornik Veleučilišta u Rijeci · doi:10.31784/zvr.9.1.17 · Cited by 9
Metadata
- Authors
- Michailidis, P. D., & Margaritis, K. G.
- Affiliations
- University of Macedonia (GR)
- Corresponding author
- Margaritis, K.G.
- Venue
- International Journal of Computer Mathematics
- Publisher
- Informa UK Limited
- Published
- 2001-01
- Volume
- 76
- Issue
- 4
- Pages
- 411-434
- ISSN
- 0020-7160 (ISSN-L)
- 1029-0265
- OpenAlex
- W2134820505
- Cited by
- 53
- References
- 33
- Citations by year
- 2025: 1 · 2023: 3 · 2021: 2 · 2020: 2 · 2019: 3 · 2018: 2 · 2017: 2 · 2015: 1 · 2013: 5 · 2012: 4
- FWCI
- 1.42
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- International Journal of Computer Mathematics (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
- Physical Sciences › Mathematics › Theoretical Computer Science › Optimization and Search Problems
- Keywords
- string matching, suffix automata, bit-parallel algorithms, hashing, character comparison, execution time, DNA sequence matching, binary alphabet
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: On-line string matching algorithms: survey and experimental results. https://app.cochat.ai/papers/10.1080/00207160108805036
- The paper
- Michailidis, P. D., & Margaritis, K. G. (2001). On-line string matching algorithms: survey and experimental results. International Journal of Computer Mathematics. https://doi.org/10.1080/00207160108805036
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.
