Shortest Common Supersequence: LCS Application
The Shortest Common Supersequence (SCS) problem asks a deceptively simple question: given two strings X and Y, what is the shortest string that contains both X and Y as subsequences? A subsequence…
Read more →