# 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} }

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.

#### Topics from this paper

#### 1,153 Citations

A simple linear space algorithm for computing a longest common increasing subsequence

- Mathematics, Computer Science
- ArXiv
- 2016

A fast algorithm for the longest-common-subsequence problem

- Mathematics, Computer Science
- Inf. Sci.
- 1980

An almost-linear time and linear space algorithm for the longest common subsequence problem

- Mathematics, Computer Science
- Inf. Process. Lett.
- 2005

The Longest Common Subsequence Distance using a Complexity Factor

- Mathematics, Computer Science
- KDIR
- 2016