Journal of AlgorithmsVolume 14, Issue 3, May 1993, Pages 466-477Regular ArticleOn the Set LCS and Set-Set LCS ProblemsAuthor links open overlay panelWang B.F., Chen G.H., Park K.Show moreShareCitehttps://doi.org/10.1006/jagm.1993.1025Get rights and contentAbstractWe 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.Recommended articlesReferences (0)Cited by (0)View full textCopyright © 1993 Academic Press. All rights reserved.