The set LCS problem |
| |
| Authors: | D. S. Hirschberg and L. L. Larmore |
| |
| Affiliation: | (1) Department of Information and Computer Science, University of California, 92717 Irvine, CA, USA |
| |
| 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. |
| |
| Keywords: | Subsequence Common subsequence Dynamic programming |
| 本文献已被 SpringerLink 等数据库收录！ |
|
