Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Shortest common supersequence problem

Known as: Shortest common supersequence, Shortest common superstring problem 
In computer science, the shortest common supersequence problem is a problem closely related to the longest common subsequence problem. Given two… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
A weighted string, also known as a position weight matrix, is a sequence of probability distributions over some alphabet. We… Expand
2016
2016
The Shortest Common Supersequence problem is an NP-hard optimization problem that has a vast use in real world problems. It is… Expand
  • figure 2
  • figure 5
  • figure 6
  • table I
2009
2009
The problem of finding the Shortest Common Supersequence (SCS ) of an arbitrary number of input strings is a well-studied problem… Expand
2007
2007
The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
2005
2005
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. We… Expand
  • table 1
  • table 2
Highly Cited
2003
Highly Cited
2003
We show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet longest common subsequence (LCS… Expand
  • figure 1
  • figure 2
2001
2001
In this paper, the problem of finding the shortest common supersequence (SCS) of a set of sequences is considered. The SCS… Expand
2001
2001
In this paper an approximation algorithm, called ReduceExpand, for the Shortest Common Supersequence (SCS) problem is presented… Expand
  • table 2
  • table 1
  • figure 1
  • table 3
Highly Cited
1994
Highly Cited
1994
Finding shortest common supersequences (SCS) and longest common subsequences (LCS) for a given set of sequences are two well… Expand
Highly Cited
1981
Highly Cited
1981
Abstract We consider the complexity of the Shortest Common Supersequence (SCS) problem, i.e. the problem of finding for finite… Expand
  • figure 4
  • figure 3
  • figure 6
  • figure 7
  • figure 8