A linear space algorithm for computing maximal common subsequences

@article{Hirschberg1975ALS,
  title={A linear space algorithm for computing maximal common subsequences},
  author={Daniel S. Hirschberg},
  journal={Communications of the ACM},
  year={1975},
  volume={18},
  pages={341 - 343}
}
  • D. Hirschberg
  • Published 1 June 1975
  • Mathematics
  • Communications of the 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
TLDR
An extremely simple linear space algorithm based on the new formula can find a longest common increasing subsequence of sizes n and m in time O(nm) using additional $\min\{n,m\}+1$ space.
A fast algorithm for the longest-common-subsequence problem
The set LCS problem
An efficient algorithm is presented that solves a generalization of the Longest Common Subsequence problem, in which one of the two input strings contains sets of symbols which may be permuted. This
The Longest Restricted Common Subsequence Problem
TLDR
An algorithm is presented that solves a Longest Restricted Common Subsequence Problem (RLCS) of two partitioned strings with the restricted using of elements and the transformation of SSLCS Problem on RLCS Problem is shown.
The Longest Restricted Common Subsequence Problem 1
TLDR
An algorithm is presented that solves a Longest Restricted Common Subsequence Problem (RLCS) of two partitioned strings with the restricted using of elements and the transformation of SSLCS Problem on RLCS Problem is shown.
An almost-linear time and linear space algorithm for the longest common subsequence problem
The set-set LCS problem
An efficient algorithm is presented that solves a generalization of the Longest Common Subsequence problem, in which both of the input strings consists of sets of symbols which may be permuted.
The Longest Common Subsequence Distance using a Complexity Factor
TLDR
An original algorithm for computing the approximate length of the LCSS is proposed that uses a discretization step, a complexity invariant factor and a dynamic threshold used for skipping the computation.
A Space Efficient Algorithm for LCIS Problem
TLDR
An extremely simple linear space algorithm based on the new formula can find a longest common increasing subsequence of sizes n and m respectively, in time O(nm) using additional \(\min \{n,m\}\,+\,1\) space.
Parallel Computation of Longest-Common-Subsequence
  • Mi Lu
  • Computer Science
    ICCI
  • 1990
TLDR
A parallel algorithm for finding the longest common subsequence of two strings, with preprocessing allowed, achieves O(logρlog2n) time complexity where ρ is the longestCommon-Subsequence.
...
...

References

SHOWING 1-4 OF 4 REFERENCES
The String-to-String Correction Problem
TLDR
An algorithm is presented which solves the string-to-string correction problem in time proportional to the product of the lengths of the two strings.
Selected combinatorial research problems.
Thirty-seven research problems are described, covering a wide range of combinatorial topics. Unlike Hilbert''s problems, most of these are not especially famous and they might be "do-able" in the
Bounds on the Complexity of the Longest Common Subsequence Problem
TLDR
It is shown that unless a bound on the total number of distinct symbols is assumed, every solution to the problem can consume an amount of time that is proportional to the product of the lengths of the two strings.
Proc. 15th Ann. Symp. on Switching and Automata Theory
  • Proc. 15th Ann. Symp. on Switching and Automata Theory
  • 1974