Abstract

INTRODUCTION The Shortest Common Supersequence (SCS) and the Longest Common Subsequence (LCS) are classical problems in computer science. Shortest Common Supersequence (SCS) integer . is a supersequence Longest Common Subsequence (LCS) integer . is a subsequence The LCS and (not so much) the SCS problems have been extensively studied over the last 30 years (see [7] and references). They are both known to be NP-complete [8, 9]. In particular the case where the number of sequences is 2 has been studied in detail (see [7] and references). A string a is a supersequence of a string b if we can delete some characters in a such that the remaining string is equal to b, e.g. \1234" is a supersequence of \13". A string a is a subsequence of a string b if b is a supersequence of a, e.g. \13" is a subsequence of \1234". 1.1. Sequence Comparison in Bioinformatics With the recent availability of large amounts of molecular sequence data, the LCS and related problems received

Citations

695	Parameterized Complexity - Downey, Fellows - 1999
110	The complexity of some problems on subsequences and super sequences - Maier
54	Bounds on the complexity of the longest common subsequence problem - Aho, Hirschberg, et al. - 1976
35	M: The parameterized complexity of sequence alignment and consensus - Bodlaender, Downey, et al. - 1995
31	The shortest common supersequence problem over binary alphabet is NP-complete, Theoret - Raiha, Ukkonen - 1981
22	Two algorithms for the longest common subsequence of three (or more) strings - Irving, Fraser - 1992
13	The longest common subsequence problem for small alphabet size between many strings - HAKATA, IMAI - 1992
9	Parameterized complexity analysis in computational biology - Bodlaender, Downey, et al. - 1995
6	An integrated complexity analysis of problems from computational biology - Hallett - 1996