The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A faster algorithm computing string edit distances
Open accessOverview
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
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
The String-to-String Correction Problem
Wagner, R. A., & Fischer, M. J. (1974) · Journal of the ACM · doi:10.1145/321796.321811 · Cited by 3,032
A linear space algorithm for computing maximal common subsequences
Hirschberg, D. S. (1975) · Communications of the ACM · doi:10.1145/360825.360861 · Cited by 1,093
Proceedings 35th Annual Symposium on Foundations of Computer Science
(1994) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365747 · Cited by 593
An Extension of the String-to-String Correction Problem
Wagner, R. A., & Lowrance, R. (1975) · Journal of the ACM · doi:10.1145/321879.321880 · Cited by 313
Bounds on the Complexity of the Longest Common Subsequence Problem
Ullman, J. D., Aho, A. V., & Hirschberg, D. S. (1976) · Journal of the ACM · doi:10.1145/321921.321922 · Cited by 247
Bounds for the String Editing Problem
Wong, C. K., & Chandra, A. K. (1976) · Journal of the ACM · doi:10.1145/321921.321923 · Cited by 121
Cited by
A guided tour to approximate string matching
Navarro, G. (2001) · ACM Computing Surveys · doi:10.1145/375360.375365 · Cited by 2,561
Optimal alignments in linear space
Myers, E. W., & Miller, W. (1988) · Bioinformatics · doi:10.1093/bioinformatics/4.1.11 · Cited by 1,235
A Normalized Levenshtein Distance Metric
Yujian, L., & Bo, L. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1078 · Cited by 986
AnO(ND) difference algorithm and its variations
Myers, E. W. (1986) · Algorithmica · doi:10.1007/bf01840446 · Cited by 893
A survey of longest common subsequence algorithms
Bergroth, L., Hakonen, H., & Raita, T. (2002) · Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000 · doi:10.1109/spire.2000.878178 · Cited by 655
Metadata
- Authors
- Masek, W. J., & Paterson, M. S.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 1980-02
- Volume
- 20
- Issue
- 1
- Pages
- 18-31
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W2012010763
- Cited by
- 651
- References
- 7
- FWCI
- 4.09
- 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 faster algorithm computing string edit distances. https://app.cochat.ai/papers/10.1016/0022-0000(80)90002-1
- The paper
- Masek, W. J., & Paterson, M. S. (1980). A faster algorithm computing string edit distances. Journal of Computer and System Sciences. https://doi.org/10.1016/0022-0000(80)90002-1
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.