A linear space algorithm for computing maximal common subsequences

  • Authors:
  • D. S. Hirschberg

  • Affiliations:
  • Princeton Univ., Princeton, NJ

  • Venue:
  • Communications of the ACM
  • Year:
  • 1975

Quantified Score

Hi-index 48.32

Visualization

Abstract

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.