The set LCS problem
eScholarship, University of California, 1985
Online
academicJournal
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.
Titel: |
The set LCS problem
|
---|---|
Autor/in / Beteiligte Person: | Hirschberg, D. S. ; Larmore, L. L. |
Link: | |
Veröffentlichung: | eScholarship, University of California, 1985 |
Medientyp: | academicJournal |
Sonstiges: |
|