On the Set LCS and Set-Set LCS Problems.
Journal
J. Algorithms
Journal Volume
14
Journal Issue
3
Pages
466-477
Date Issued
1993
Author(s)
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. © 1993 Academic Press, Inc.
Type
journal article