Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Computer scienceLongest common subsequence problem

Broader (1)

Dynamic programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Solving shortest common supersequence problem using chemical reaction optimization
The Shortest Common Supersequence problem is an NP-hard optimization problem that has a vast use in real world problems. It is… 
2013
2013
Approximating Shortest Superstring Problem Using de Bruijn Graphs
The best known approximation ratio for the shortest superstring problem is \(2\frac{11}{23}\) (Mucha, 2012). In this note, we… 
2011
2011
Evolutionary-based iterative local search algorithm for the shortest common supersequence problem
The Shortest Common Supersequence (SCS) problem is a well-known hard combinatorial optimization problem with applications in many… 
2011
2011
Solving Shortest Common Supersequence Problem Using Artificial Bee Colony Algorithm
idea behind this work is to solve the Shortest Common Supersequence by using Artificial Bee Colony (ABC) Algorithm. This… 
2010
2010
Restricted Common Superstring and Restricted Common Supersequence
The shortest common superstring and the shortest common supersequence are two well studied problems having a wide range of… 
2010
2010
Efficient stochastic local search algorithm for solving the shortest common supersequence problem
The Shortest Common Supersequence (SCS) problem is a well-known hard combinatorial optimization problem that formalizes many real… 
2009
2009
Improved Approximation Results on the Shortest Common Supersequence Problem
The problem of finding the Shortest Common Supersequence (SCS ) of an arbitrary number of input strings is a well-studied problem… 
2005
2005
A Comparison of Evolutionary Approaches to the Shortest Common Supersequence Problem
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications… 
2001
2001
An approximation algorithm for the shortest common supersequence problem: an experimental analysis
In this paper an approximation algorithm, called ReduceExpand, for the Shortest Common Supersequence (SCS) problem is presented… 
1983
1983
The Noisy Substring Matching Problem
Let T(U) be the set of words in the dictionary H which contains U as a substring. The problem considered here is the estimation… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)