|
156
|
Algorithms for approximate string matching
– E Ukkonen
- 1985
|
|
851
|
Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady 10: 707–710
– Levenshtein
- 1966
|
|
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, Addison-Wesley
– D Sankoff, J B Kruskal
- 1983
|
|
10
|
The noisy substring matching problem
– R L Kashyap, B J Oommen
- 1983
|
|
17
|
Approximate string matching. Computing Surveys 12(4):381–402
– P A V Hall, G R Dowling
- 1980
|
|
5
|
Symbolic Channel Modelling For Noisy Channels Which Permit Arbitrary Noise Distributions
– Oommen And Kashyap, B. J. Oommen, R. L. Kashyap
- 1993
|
|
27
|
Bounds for the string editing problem
– C Wong, A Chandra
- 1976
|
|
31
|
A method for the correction of garbled words based on the Levenshtein metric
– T Okuda, E Tanaka, T Kasai
- 1976
|
|
18
|
An effective algorithm for string correction using generalized edit distances-III. Computational complexity of Xhe algorithm and some app~cations Infor~tion Sci
– R. L. Kashyap, B. J. Oommen, Communicated John, M. Richardson
|
|
137
|
Algorithms for the longest common subsequence problem
– D S Hirschberg
- 1977
|
|
101
|
The string to string correction problem
– R Wagner, M Fisher
- 1974
|
|
53
|
Computer Programs for Detecting and Correcting Spelling Errors
– L J Peterson
- 1980
|
|
54
|
Vidal E: Computation of normalized edit distance and applications
– A Marzal
- 1993
|
|
134
|
TG: A Fast Algorithm for Computing Longest Common Subsequences
– Hunt JW, Szymanski
- 1977
|
|
144
|
A faster algorithm for computing string edit distances
– W J Masek, M S Paterson
- 1980
|
|
2
|
A multi-level framework for the analysis of sequential data
– C H Mooney, D de Vries, J F Roddick
- 2004
|
|
6
|
A Unifying Semantic Distance Model for Determining the Similarity Of Attribute Values
– John Roddick, Kathleen Hornsby, Denise Vries
- 2003
|
|
1953
|
Mining Association Rules between Sets of Items in Large Databases
– Rakesh Agrawal, Tomasz Imielinski, Arun Swami
- 1993
|