Digitale Medien
Springer
Algorithmica
2 (1987), S. 91-95
ISSN:
1432-0541
Schlagwort(e):
Subsequence
;
Common subsequence
;
Dynamic programming
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Informatik
,
Mathematik
Notizen:
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.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01840351
Permalink
|
Standort |
Signatur |
Erwartet |
Verfügbarkeit |
