Abstract
An efficient algorithm is presented that solves a generalization of the Longest Common Subsequence problem, in which one of the two input strings contains sets of symbols which may be permuted. This problem arises from a music application.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. J. Block and R. B. Dannenberg, Real-time computer accompaniment of keyboard performances,Proceedings of the 1985 International Computer Music Conference, August 1985.
R. B. Dannenberg, Personal communication to D. S. Hirschberg, June 1985.
D. S. Hirschberg, A linear space algorithm for computing maximal common subsequences,Comm. ACM,18, 6 (June 1975), 341–343.
W. J. Masek and M. S. Paterson, A faster algorithm for computing string-edit distances,J. Comp. System Sci,20, 1 (1980), 18–31.
Author information
Authors and Affiliations
Additional information
Communicated by David P. Dobkin.
Rights and permissions
About this article
Cite this article
Hirschberg, D.S., Larmore, L.L. The set LCS problem. Algorithmica 2, 91–95 (1987). https://doi.org/10.1007/BF01840351
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01840351