A linear space algorithm for computing maximal common subsequences

@article{Hirschberg1975ALS,
  title={A linear space algorithm for computing maximal common subsequences},
  author={D. Hirschberg},
  journal={Commun. ACM},
  year={1975},
  volume={18},
  pages={341-343}
}
  • D. Hirschberg
  • Published 1975
  • Mathematics, Computer Science
  • Commun. ACM
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. 
A simple linear space algorithm for computing a longest common increasing subsequence
A fast algorithm for the longest-common-subsequence problem
The set LCS problem
The Longest Restricted Common Subsequence Problem
An almost-linear time and linear space algorithm for the longest common subsequence problem
The set-set LCS problem
The Longest Common Subsequence Distance using a Complexity Factor
A Space Efficient Algorithm for LCIS Problem
...
1
2
3
4
5
...