Journal ArticleOPEN ACCESS

A Linear Space Algorithm for Computing Maximal Common Subsequences

Communications of the ACM (1975) 18(6) 341-343
DOI: 10.1145/360825.360861
928Citations
Citations of this article
233Readers
Mendeley users who have this article in their library.

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. © 1975, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Hirschberg, D. S. (1975). A Linear Space Algorithm for Computing Maximal Common Subsequences. Communications of the ACM, 18(6), 341–343. https://doi.org/10.1145/360825.360861

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free