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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1991-2016
01219912016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Shortest common supersequence (SCS) is a classical NP-hard problem, where a string to be constructed that is the supersequence of… (More)
Is this relevant?
2016
2016
The Shortest Common Supersequence problem is an NP-hard optimization problem that has a vast use in real world problems. It is… (More)
  • figure 2
  • figure 5
  • figure 6
  • table I
Is this relevant?
2013
2013
Article history: Received 26 October 2011 Accepted 7 March 2013 Available online 21 March 2013 
Is this relevant?
2013
2013
  • Anna Gorbenko, A. Gorbenko
  • 2013
In this paper, we consider the problem of the shortest common ordered supersequence. In particular, we consider an explicit… (More)
  • table 1
  • table 2
Is this relevant?
2011
2011
The Shortest Common Supersequence (SCS) problem is a well-known hard combinatorial optimization problem with applications in many… (More)
  • figure 1
  • figure 2
  • figure 4
  • table 1
  • table 2
Is this relevant?
2010
2010
The Shortest Common Supersequence (SCS) problem is a well-known hard combinatorial optimization problem that formalizes many real… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 4
Is this relevant?
2006
2006
The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2003
2003
MOTIVATION During microarray production, several thousands of oligonucleotides (short DNA sequences) are synthesized in parallel… (More)
  • figure 1
  • figure 2
Is this relevant?
2003
2003
In this paper we deal with algorithm A∗ and its application to the problem of 0nding the shortest common supersequence of a set… (More)
  • figure 1
  • table 1
Is this relevant?
2001
2001
In this paper an approximation algorithm, called ReduceExpand, for the Shortest Common Supersequence (SCS) problem is presented… (More)
  • table 2
  • table 1
  • figure 1
  • table 3
Is this relevant?