Regular Article
On the Set LCS and Set-Set LCS Problems

https://doi.org/10.1006/jagm.1993.1025Get rights and content

Abstract

We consider two generalizations of the longest common subsequence (LCS) problem: the Set LCS problem and the Set-Set LCS problem. We present algorithms for the two problems that are faster than the previous ones by Hirschberg and Larmore.

References (0)

Cited by (0)

View full text