The Prague Stringology Club Workshop '99
The Closest Common Subsequence Problems
| Abstract: |
| Efficient algorithms are presented that solve general cases of the Common Subsequence Problems, in which both input strings contain symbols with competence values or sets of symbols with competence values. These problems arise from a searching of the sets of most similar strings. |
| Download paper: |  |
 |
| PostScript |