论文信息 - On a Cyclic String-To-String Correction Problem - 字舞流文

On a Cyclic String-To-String Correction Problem

We present an O(nm log m) algorithm to solve the string-to-string correction problem for cyclic strings.

M. Maes | M. Maes

[1] King-sun Fu,et al. Stochastic Error-Correcting Syntax Analysis for Recognition of Noisy Patterns , 1977, IEEE Transactions on Computers.

[2] Wen-Hsiang Tsai,et al. Attributed String Matching with Merging for Shape Recognition , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3] Daniel S. Hirschberg,et al. A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.

[4] Tzu-I Fan,et al. Optimal matching of deformed patterns with positional influence , 1987, Inf. Sci..

[5] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.

[6] Hong-Chih Liu,et al. Classification Of Partial Shapes Using String-To-String Matching , 1989, Other Conferences.