The Prague Stringology Club Workshop '98

Gabriela AndrejkovŠ

The Longest Restricted Common Subsequence Problem

Abstract:
An efficient algorithm is presented that solves a Longest Restricted Common Subsequence Problem (RLCS) of two partitioned strings with the restricted using of elements. The above algorithm has an application in solution of the Set-Set Longest Common Subsequence Problem (SSLCS). It is shown the transformation of SSLCS Problem on RLCS Problem

Download article: Article in PostScript Article in PDF
 PostScript   PDF