The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
Abstract
A wide variety of different applications lead to problems in which sequences of different lengths must be compared, to see how different they are, and to see which elements in one sequence correspond to which elements in the other sequence. Successful methods for handling these problems been repeatedly reinvented which incorporate two basic ideas a systematic concept of distance between sequences, and elegant recursive algorithms for doing the necessary computations. The major application areas are speech processing and macromolecular biology. Computer science is another significant application area, and applications have also been made to bird song, handwriting analysis, gas chromatography, geological strata, and text collation. This paper surveys the applications, methods and theory of sequence comparison.
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
Binary Codes capable of currecting deletions, insertions, and reversals
Levenshtein, V. I. (1965) · Soviet physics. Doklady · Cited by 14,807
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Dynamic Programming Algorithm Optimization for Spoken Word Recognition
Sakoe, H., & Chiba, S. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163055 · Cited by 6,727
Fitch, W. M., & Margoliash, E. (1967) · Science · doi:10.1126/science.155.3760.279 · Cited by 3,610
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
Foundations of Cyclopean Perception
Richards, W., & Julesz, B. (1973) · The American Journal of Psychology · doi:10.2307/1421958 · Cited by 2,392
Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison
Sankoff, D., & Kruskal, J. B. (1983) · Medical Entomology and Zoology · Cited by 1,915
Self-citationMinimum prediction residual principle applied to speech recognition
Itakura, F. (1975) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1975.1162641 · Cited by 1,627
A technique for computer detection and correction of spelling errors
Damerau, F. J. (1964) · Communications of the ACM · doi:10.1145/363958.363994 · Cited by 1,575
Cited by
Multimodal Machine Learning: A Survey and Taxonomy
Baltrusaitis, T., Ahuja, C., & Morency, L.-P. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2798607 · Cited by 5,018
Rapid and sensitive protein similarity searches
Lipman, D. J., & Pearson, W. R. (1985) · Science · doi:10.1126/science.2983426 · Cited by 4,033
Exact indexing of dynamic time warping
Keogh, E., & Ratanamahatana, C. A. (2005) · Knowledge and Information Systems · doi:10.1007/s10115-004-0154-9 · Cited by 1,962
The state of the art in online handwriting recognition
Tappert, C. C., Suen, C. Y., & Wakahara, T. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.57669 · Cited by 857
State of the Art in Shape Matching
Veltkamp, R. C., & Hagedoorn, M. (2001) · Advances in Pattern Recognition · doi:10.1007/978-1-4471-3702-3_4 · Cited by 535
Studer, M., & Ritschard, G. (2016) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/rssa.12125 · Cited by 500
Lutzoni, F., Wagner, P., Reeb, V., & Zoller, S. (2000) · Systematic Biology · doi:10.1080/106351500750049743 · Cited by 351
A survey of temporal data mining
Laxman, S., & Sastry, P. S. (2006) · Sadhana · doi:10.1007/bf02719780 · Cited by 314
Setting Cost in Optimal Matching to Uncover Contemporaneous Socio-Temporal Patterns
Lesnard, L. (2010) · Sociological Methods & Research · doi:10.1177/0049124110362526 · Cited by 304
Tracking Code Clones in Evolving Software
Duala-Ekoko, E., & Robillard, M. P. (2007) · 29th International Conference on Software Engineering (ICSE'07) · doi:10.1109/icse.2007.90 · Cited by 222
Kershenbaum, A., Root-Gutteridge, H., Habib, B., Koler-Matznick, J., Mitchell, B., Palacios, V., & Waller, S. (2016) · Behavioural Processes · doi:10.1016/j.beproc.2016.01.006 · Cited by 38
Using Denoising Autoencoder Genetic Programming to Control Exploration and Exploitation in Search
Wittenberg, D. (2022) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-02056-8_7 · Cited by 7
Metadata
- Authors
- Kruskal, J. B.
- Venue
- SIAM Review
- Published
- 1983-04
- Volume
- 25
- Issue
- 2
- Pages
- 201-237
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2057568625
- Cited by
- 352
- References
- 44
- FWCI
- 5.29
- Type
- journal article
- Language
- en
- Open access
- closed
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.