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… 
2016
2016
Feasibility recovery for the Unit-capacity Constrained Permutation Problem
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… 
2013
2013
Solving 3-Superstring in 3 n/3 Time
In the shortest common superstring problem (SCS) one is given a set s 1, …, s n of n strings and the goal is to find a shortest… 
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
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… 
2006
2006
Viral Genome Compression
Viruses compress their genome to reduce space. One of the main techniques is overlapping genes. We model this process by the… 
2004
2004
A Genetic Algorithm for the Shortest Common Superstring Problem
Many real world problems can be modeled as the shortest common superstring problem. This problem has several important… 
1993
1993
Approximating Shortest Superstrings with Constraints (Extended Abstract)
Various versions of the shortest common superstring problem play important roles in data compression and DNA sequencing. Only… 
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)