共 18 条
[1]
Levenshtein VI(1966)Binary codes capable of correcting deletions, insertions, and reversals Sov Phys Dokl 10 707-10
[2]
Damerau FJ(1964)A technique for computer detection and correction of spelling errors Commun ACM 7 171-6
[3]
Maier D(1978)The complexity of some problems on subsequences and supersequences J ACM 25 322-36
[4]
Jaro MA(1989)Advances in record-linkage methodology as applied to matching the 1985 census of Tampa, Florida J Am Stat Assoc 84 414-20
[5]
Needleman SB(1970)A general method applicable to the search for similarities in the amino acid sequence of two proteins J Mol Biol 48 443-53
[6]
Wunsch CD(1981)Identification of common molecular subsequences J Mol Biol 147 195-7
[7]
Smith TF(1975)An extension of the string-to-string correction problem J ACM 22 177-83
[8]
Waterman MS(2007)On data mining, compression, and kolmogorov complexity Data Min Knowl Disc 15 3-20
[9]
Lowrance R(2003)A bit-vector algorithm for computing levenshtein and damerau edit distances Nord J Comput 10 29-39
[10]
Wagner RA(1974)The string-to-string correction problem J ACM 21 168-73