About This Website
This website was designed to showcase two algorithms: the first one is on the Longest Common Subsequence and Substring (LCSS) problem and the second one is on the Constrained Longest Common Subsequence and Substring (CLCSS) problem. A subsequence is a sequence that appears in the same relative order, but not necessarily contiguous. A substring is a contiguous sequence within a string.
Website Developer
The Longest Common Subsequence and Substring (LCSS)
The Longest Common Subsequence and Substring (LCSS) problem for two strings X and Y is to find the longest string Z which is a subsequence of X and a substring of Y.
Research PaperAlgorithm Designers
The Constrained Longest Common Subsequence and Substring (CLCSS)
The Constrained Longest Common Subsequence and Substring (CLCSS) problem for two strings X and Y and a constrained string P is to find the longest string Z such that Z is a subsequence of X, a substring of Y , and has P as a subsequence.
Research PaperAlgorithm Designers