Finding approximate patterns in strings

Journal of Algorithms - Tập 6 Số 1 - Trang 132-137 - 1985
Esko Ukkonen1
1Department of Computer Science, University of Helsinki, Tukholmankatu 2, SF-00250 Helsinki 25, Finland

Tóm tắt

Từ khóa


Tài liệu tham khảo

Boyer, 1977, A fast string matching algorithm, Comm. ACM, 20, 262, 10.1145/359842.359859

Knuth, 1977, Fast pattern matching in strings, SIAM J. Comput., 6, 323, 10.1137/0206024

Levenshtein, 1966, Binary codes capable of correcting deletions, insertions and reversals, Soviet Phys. Dokl., 10, 707

Sellers, 1980, The theory and computation of evolutionary distances: Pattern recognition, J. Algorithms, 1, 359, 10.1016/0196-6774(80)90016-4

Wagner, 1974, The string-to-string correction problem, J. Assoc. Comput. Mach., 21, 168, 10.1145/321796.321811