The Prague Stringology Club Workshop 2000
The Set-Set Closest Common Subsequence Problem
| Abstract: |
| Efficient algorithm is presented that solves a general case of the Common Subsequence Problem, in which both input strings contain sets of symbols with membership values in the sets. The problem arises from a searching of the sets of most similar strings. |
| Download paper: |  |
 |
| PostScript |