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.
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 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
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
Foundations of Cyclopean Perception
Wilson, H. R., & Julesz, B. (1972) · Chicago Review · doi:10.2307/25294744 · Cited by 973
Problems of Information Transmission
(2013) · Problems of Information Transmission · doi:10.1134/11122.1608-3253 · Cited by 931
Hall, P. A. V., & Dowling, G. R. (1980) · ACM Computing Surveys · doi:10.1145/356827.356830 · Cited by 586
Atlas of Protein Sequence and Structure 1969
Burger, A. (1970) · Journal of Medicinal Chemistry · doi:10.1021/jm00296a903 · Cited by 586
Minimal Mutation Trees of Sequences
Sankoff, D. (1975) · SIAM Journal on Applied Mathematics · doi:10.1137/0128004 · Cited by 575
Performance tradeoffs in dynamic time warping algorithms for isolated word recognition
Myers, C., Rabiner, L., & Rosenberg, A. (1980) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1980.1163491 · Cited by 568
Speech discrimination by dynamic programming
Vintsyuk, T. K. (1972) · Cybernetics · doi:10.1007/bf01074755 · Cited by 431
Radiocarbon variations and absolute chronology
Mook, W. G. (1971) · Earth-Science Reviews · doi:10.1016/0012-8252(71)90023-7 · Cited by 384
Considerations in dynamic time warping algorithms for discrete word recognition
Rabiner, L., Rosenberg, A., & Levinson, S. (1978) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1978.1163164 · Cited by 369
A Dynamic Programming Approach to Continuous Speech Recognition
Sakoe, H., & Chiba, S. (1971) · Cited by 358
(1972) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6010-2 · Cited by 341
Goad, W. B., & Kanehisa, M. I. (1982) · Nucleic Acids Research · doi:10.1093/nar/10.1.247 · Cited by 323
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
International Encyclopedia of Statistics
J., J. E. (1979) · Technometrics · doi:10.1080/00401706.1979.10489790 · Cited by 299
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
A level building dynamic time warping algorithm for connected word recognition
Myers, C., & Rabiner, L. (1981) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1981.1163527 · Cited by 261
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
Automatic recognition of 200 words
Velichko, V. M., & Zagoruyko, N. G. (1970) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(70)80008-6 · Cited by 225
Elastic Matching of Line Drawings
Burr, D. J. (1981) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1981.4767176 · Cited by 185
Principles of Dynamic Programming
Larson, R. E. (1978) · CERN Document Server (European Organization for Nuclear Research) · Cited by 170
Speech recognition experiments with linear predication, bandpass filtering, and dynamic programming
White, G., & Neely, R. (1976) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1976.1162779 · Cited by 158
Frequency of insertion-deletion, transversion, and transition in the evolution of 5S ribosomal RNA
Sankoff, D., Cedergren, R., & Lapalme, G. (1976) · Journal of Molecular Evolution · doi:10.1007/bf01732471 · Cited by 139
Bounds for the String Editing Problem
Wong, C. K., & Chandra, A. K. (1976) · Journal of the ACM · doi:10.1145/321921.321923 · Cited by 126
Spelling correction in systems programs
Morgan, H. L. (1970) · Communications of the ACM · doi:10.1145/362007.362033 · Cited by 104
Evolution of 5S RNA and the Non-randomness of Base Replacement
Sankoff, D., MOREL, C., & Cedergren, R. (1973) · Nature New Biology · doi:10.1038/newbio245232a0 · Cited by 94
String similarity and misspellings
Alberga, C. N. (1967) · Communications of the ACM · doi:10.1145/363282.363326 · Cited by 72
Designing a Handwriting Reader
Burr, D. (1983) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1983.4767435 · Cited by 59
Global Stereopsis: Cooperative Phenomena in Stereoscopic Depth Perception
Julesz, B. (1978) · Handbook of sensory physiology · doi:10.1007/978-3-642-46354-9_7 · Cited by 57
Kanehisa, M. I., & Goad, W. B. (1982) · Nucleic Acids Research · doi:10.1093/nar/10.1.265 · Cited by 55
Computer-aided prediction of RNA secondary structures
Auron, P. E., Rindone, W. P., Vary, C., Celentano, J. J., & Vournakis, J. N. (1982) · Nucleic Acids Research · doi:10.1093/nar/10.1.403 · Cited by 50
Signature Verification Experiment Based on Nonlinear Time Alignment: A Feasibility Study
(1977) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.1977.4309686 · Cited by 30
Nussinov, R., Tinoco, I., & Jacobson, A. B. (1982) · Nucleic Acids Research · doi:10.1093/nar/10.1.341 · Cited by 27
Correspondent, O. W. (1973) · Nature · doi:10.1038/245232a0 · Cited by 19
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
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.