The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Algorithms for approximate string matching
Open accessAbstract
The edit distance between strings a 1 … a m and b 1 … b n is the minimum cost s of a sequence of editing steps (insertions, deletions, changes) that convert one string into the other. A well-known tabulating method computes s as well as the corresponding editing sequence in time and in space O ( mn ) (in space O (min( m, n )) if the editing sequence is not required). Starting from this method, we develop an improved algorithm that works in time and in space O ( s · min( m, n )). Another improvement with time O ( s · min( m, n )) and space O ( s · min( s, m, n )) is given for the special case where all editing steps have the same cost independently of the characters involved. If the editing sequence that gives cost s is not required, our algorithms can be implemented in space O (min( s, m, n )). Since s = O (max( m, n )), the new methods are always asymptotically as good as the original tabulating method. As a by-product, algorithms are obtained that, given a threshold value t , test in time O ( t · min( m, n )) and in space O (min( t, m, n )) whether s ⩽ t . Finally, different generalized edit distances are analyzed and conditions are given under which our algorithms can be used in conjunction with extended edit operation sets, including, for example, transposition of adjacent characters.
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
Cites
Binary Codes capable of currecting deletions, insertions, and reversals
Levenshtein, V. I. (1965) · Soviet physics. Doklady · Cited by 14,811
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288
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
On the Theory and Computation of Evolutionary Distances
Sellers, P. H. (1974) · SIAM Journal on Applied Mathematics · doi:10.1137/0126070 · Cited by 474
Speech discrimination by dynamic programming
Vintsyuk, T. K. (1972) · Cybernetics · doi:10.1007/bf01074755 · Cited by 431
The theory and computation of evolutionary distances: Pattern recognition
Sellers, P. H. (1980) · Journal of Algorithms · doi:10.1016/0196-6774(80)90016-4 · Cited by 372
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
Matching Sequences under Deletion/Insertion Constraints
Sankoff, D. (1972) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.69.1.4 · Cited by 296
Cited by
A Greedy Algorithm for Aligning DNA Sequences
Zhang, Z., Schwartz, S., Wagner, L., & Miller, W. (2000) · Journal of Computational Biology · doi:10.1089/10665270050081478 · Cited by 5,478
REPuter: the manifold applications of repeat analysis on a genomic scale
Kurtz, S. (2001) · Nucleic Acids Research · doi:10.1093/nar/29.22.4633 · Cited by 2,618
A guided tour to approximate string matching
Navarro, G. (2001) · ACM Computing Surveys · doi:10.1145/375360.375365 · Cited by 2,561
LTRharvest, an efficient and flexible software for de novo detection of LTR retrotransposons
Ellinghaus, D., Kurtz, S., & Willhoeft, U. (2008) · BMC Bioinformatics · doi:10.1186/1471-2105-9-18 · Cited by 1,641
Optimal alignments in linear space
Myers, E. W., & Miller, W. (1988) · Bioinformatics · doi:10.1093/bioinformatics/4.1.11 · Cited by 1,235
Metadata
- Authors
- Ukkonen, E.
- Venue
- Information and Control
- Publisher
- Elsevier BV
- Published
- 1985-01
- Volume
- 64
- Issue
- 1-3
- Pages
- 100-118
- ISSN
- 0019-9958 (ISSN-L)
- OpenAlex
- W2011632873
- Cited by
- 610
- References
- 8
- FWCI
- 1.71
- 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: Algorithms for approximate string matching. https://app.cochat.ai/papers/10.1016/s0019-9958(85)80046-2
- The paper
- Ukkonen, E. (1985). Algorithms for approximate string matching. Information and Control. https://doi.org/10.1016/s0019-9958(85)80046-2
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.