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
Novel Applications of Stochastic Global Optimization Algorithms to the Shortest Common Superstring Problem
The shortest common superstring problem aims to find a string with minimal length that contains every string in a given set. This… 
2013
2013
The constrained shortest common supersequence problem
  • R. Dondi
  • J. Discrete Algorithms
  • 2013
  • Corpus ID: 33776595
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… 
2011
2011
Application of Reversal Operation in Optimizing Synthesis Strategy for DNA Microarrays
NA 
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
Algorithms for NP-Hard problems related to strings and for approximate pattern matching and repeats
This thesis has two main topics. The first one is design and analysis of approximation algorithms for NP-hard problems that are… 
1999
1999
Problems related to subsequences and supersequences
  • Zdenek Tronícek
  • 6th International Symposium on String Processing…
  • 1999
  • Corpus ID: 18747013
We present an algorithm for building the automaton that searches for all non-overlapping occurrences of each subsequence from the… 
1993
1993
Reconstructing sequences from shotgun data
One method of sequencing DNA produces a linear list of bases, {A, C, G, T}, for many short overlapping fragments of the original… 
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)