论文信息 - A linear space algorithm for computing maximal common subsequences

A linear space algorithm for computing maximal common subsequences

The problem of finding a longest common subsequence of two strings has been solved in quadratic time and space. An algorithm is presented which will solve this problem in quadratic time and in linear space.

Daniel S. Hirschberg | D. Hirschberg

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

[2] Alfred V. Aho,et al. Bounds on the Complexity of the Longest Common Subsequence Problem , 1976, J. ACM.

[3] D. Knuth,et al. Selected combinatorial research problems. , 1972 .