Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
D. S. Hirschberg (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: