ON A CYCLIC STRING-TO-STRING CORRECTION PROBLEM 关于一个循环串对串校正问题.pdfVIP

Information Processing Letters 35 (1990) 73-78 29 June 1990 North-Holland ON A CYCLIC STRING-TO-STRING CORRECTION PROBLEM Maurice MAES Philips Research Laboratories, P.O. Box 80.000, 5600 JA Eindhouen, NetherIan Communicated by G.R. Andrew Received 16 June 1989 Revised 22 January 1990 Keywords: Analysis of algorithms, string correction, cyclic strings, pattern matching 1. Introduction string. For a string A = alal.. . a, E E*, and for all i, Jo (1, 2 ,.__, n}, let A(i, j) denote the In 1974 Wagner and Fischer [l] defined a dis- string a,ai+l . . . aj, where, by convention A(i, j) tance measure on strings, based on minimum-cost = A if ij. sequences of edit operations needed to change one An edit operation s is an ordered pair (a, b) # string into another, and they presented an al- (A, A) of strings, each of length less than or gorithm that computes this distance between two equal to 1, denoted by a --) b. An edit operation strings A and B in O(nm) time where n and m a + b will be called an insert operation if a = A, a are the lengths of A and B. As a general reference delete operation if b = A, and a change operation on string-to-string correction problems and appli- otherwise. cations, we mention [2]. String-to-string correction