Algorithms for approximate string matching
Esko Ukkonen · Information and Control · 1985
Cited by 610 works. doi:10.1016/s0019-9958(85)80046-2 Open-access PDF
Authors
References
- A general method applicable to the search for similarities in the amino acid sequence of two proteins
- On the Theory and Computation of Evolutionary Distances
- The String-to-String Correction Problem
- Matching Sequences under Deletion/Insertion Constraints
- Binary codes capable of correcting deletions, insertions and reversals
- The theory and computation of evolutionary distances: Pattern recognition
- An Extension of the String-to-String Correction Problem
- A longest common subsequence algorithm suitable for similar text strings
- Speech discrimination by dynamic programming
- Information Processing