Finite automata based algorithms on subsequences and supersequences of degenerate strings

https://doi.org/10.1016/j.jda.2008.10.004Get rights and content
Under an Elsevier user license
open archive

Abstract

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.

Keywords

Finite automata
Degenerate strings
Longest common subsequence
Shortest common supersequence
Constrained longest common subsequence

Cited by (0)