Key points are not available for this paper at this time.
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.
D. S. Hirschberg (Sun,) studied this question.