Abstract
An efficient algorithm is presented that solves a generalization of the Longest Common Subsequence problem, in which both of the input strings consists of sets of symbols which may be permuted.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. J. Bloch and R. B. Dannenberg, Real-time computer accompaniment of keyboard performances,Proc. 1985 Int. Computer Music Conf. (Aug. 1985).
D. S. Hirschberg, A linear space algorithm for computing maximal common subsequences,Comm. ACM 18, 6 (1975), 341–343.
D. S. Hirschberg and L. L. Larmore, The Set LCS problem,Algorithmic 2 (1987), 91–95.
W. J. Masek and M. S. Paterson, A faster algorithm for computing string-edit distances,J. Comput. System Sci. 20, 1 (1980), 18–31.
E. W. Myers, AnO(ND) difference algorithm and its variations,Algorithmica 1 (1986), 251–266.
D. Sankoff and J. B. Kruskal (eds.),Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, Addison-Wesley, Reading, MA, 1983.
Author information
Authors and Affiliations
Additional information
Communicated by David Dobkin.
Rights and permissions
About this article
Cite this article
Hirschberg, D.S., Larmore, L.L. The set-set LCS problem. Algorithmica 4, 503–510 (1989). https://doi.org/10.1007/BF01553904
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01553904