论文信息 - A Fast Linear Space Algorithm for Computing Longest Common Subsequences - 字舞流文

A Fast Linear Space Algorithm for Computing Longest Common Subsequences

[1] Daniel S. Hirschberg,et al. Algorithms for the Longest Common Subsequence Problem , 1977, JACM.

[2] M. W. Du,et al. New Algorithms for the LCS Problem , 1984, J. Comput. Syst. Sci..

[3] Alberto Apostolico,et al. The longest common subsequence problem revisited , 1987, Algorithmica.