Finite automata based algorithms on subsequences and supersequences of degenerate strings
In this paper, we present linear-time algorithms for the construction two novel types of finite automata and show how they can be used to efficiently solve the Longest Common Subsequence (LCS), Shortest Common Supersequence (SCS) and Constrained Longest Common Subsequence (CLCS) problems for degenerate strings.
finite automata degenerate strings longest common subsequence shortest common supersequence constrained longest common subsequence