Algorithms for approximate string matching

Information and Control

Volumn 64, Issue 1-3, 1985, Pages 100-118

  Ukkonen, Esko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

APPROXIMATE STRING MATCHING; EDIT DISTANCE BETWEEN STRINGS;

COMPUTER METATHEORY;

EID: 0020494998     PISSN: 00199958     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0019-9958(85)80046-2     Document Type: Article

References (10)

1. Binary codes capable of correcting deletions, insertions, and reversals
2. An extension of the string-to-string correction problem
3. A longest common subsequence algorithm suitable for similar text strings
4. A general method applicable to the search for similarities in the amino acid sequence of two proteins
5. Algorithms for some string matching problems arising in molecular genertics
6. Matching sequences under deletion/insertion constraints
7. On the Theory and Computation of Evolutionary Distances
8. The theory and computation of evolutionary distances: Pattern recognition
9. Speech discrimination by dynamic programming
10. The string-to-string correction problem