39

A method for the correction of garbled words based on the levenshtein metric
– T Okuda, E Tanaka, T Kasai
 1976

169

A faster algorithm computing string edit distances
– W J Masek, M S Paterson
 1980

1198

Binary codes capable of correcting deletions, insertions, and reversals
– V Levenshtein
 1966

65

Computer programs for detecting and correcting spelling errors
– J L Peterson
 1980

119

The string to string correction problem
– R A Wagner, M J Fisher
 1974

12

Recognition of noisy subsequences using constrained edit distances
– B J Oommen
 1987

8

Time Warps,String Edits and Macromolecules: The Theory and practice of Sequence Comparison, AddisonWesley
– D Sankoff, J B Kruskal
 1983

10

The noisy substring matching problem
– R L Kashyap, B J Oommen
 1983

7

A common basis for similarity and dissimilarity measures involving two strings
– R L Kashyap, B J Oommen
 1983

742

The Viterbi algorithm
– G. David Forney
 1973

656

The stringtostring correction problem
– R A Wagner, M J Fischer
 1974

18

Approximate string matching, Comput. Surveys
– P A V, G R Dowling
 1980

6

String correction using probabilistic methods, Pattern Recognition Letters
– R L Kashyap, B J Oommen
 1984

176

Algorithms for the longest common subsequence problem
– Daniel S. Hirschberg
 1977

168

A fast algorithm for computing longest common subsequences
– J W Hunt, T G Szymanski
 1977

24

The Viterbi algorithm as an aid in text recognition
– D L NEUHOFF
 1975

8

Constrained string editing
– B J Oommen
 1986

29

Relative Frequency of English Speech Sounds
– G Dewey
 1923

63

Bounds on the complexity of the longest common subsequence problem
– A V. Aho, D S. Hirschberg, J D. Ullman
 1976
