Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Shortest Common Superstrings

View through CrossRef
Given a finite set of strings S = {s1,...,sm}, the shortest common superstring of S, is the shortest string s such that each si appears as a substring (a consecutive block) of s. . . . Example. . . . . . . Assume we want to find the shortest common superstring of all words in the sentence “alf ate half lethal alpha alfalfa.” Our set of strings is S = { alf, ate, half, lethal, alpha, alfalfa }. A trivial superstring of S is “alfatehalflethalalphaalfalfa”, of length 28. A shortest common superstring is “lethalphalfalfate”, of length 17, saving 11 characters. The above example shows an application of the shortest common superstring problem in data compression. In many programming languages, a character string may be represented by a pointer to that string. The problem for the compiler is to arrange strings so that they may be “overlapped” as much as possible in order to save space. For more data compression related issues, see next chapter. Other than compressing a sentence about Alf, the shortest common superstring problem has more important applications in DNA sequencing. A DNA sequence may be considered as a long character string over the alphabet of nucleotides {A, C, G, T}. Such a character string ranges from a few thousand symbols long for a simple virus, to 2 x 108 symbols for a fly and 3 x 109 symbols for a human being. Determining this string for different molecules, or sequencing the molecules, is a crucial step towards understanding the biological functions of the molecules. In fact, today, no problem in biochemistry can be studied in isolation from its genetic background. However, with current laboratory methods, such as Sanger’s procedure, it is quite impossible to sequence a long molecule directly as a whole. Each time, a randomly chosen fragment of less than 500 base pairs can be sequenced. In general, biochemists “cut”, using different restriction enzymes, millions of such (identical) molecules into pieces each typically containing about 200-500 nucleotides (characters). A biochemist “samples” the fragments and Sanger’s procedure is applied to sequence the sampled fragment. . . .
Title: Shortest Common Superstrings
Description:
Given a finite set of strings S = {s1,.
,sm}, the shortest common superstring of S, is the shortest string s such that each si appears as a substring (a consecutive block) of s.
.
.
.
Example.
.
.
.
.
.
.
Assume we want to find the shortest common superstring of all words in the sentence “alf ate half lethal alpha alfalfa.
” Our set of strings is S = { alf, ate, half, lethal, alpha, alfalfa }.
A trivial superstring of S is “alfatehalflethalalphaalfalfa”, of length 28.
A shortest common superstring is “lethalphalfalfate”, of length 17, saving 11 characters.
The above example shows an application of the shortest common superstring problem in data compression.
In many programming languages, a character string may be represented by a pointer to that string.
The problem for the compiler is to arrange strings so that they may be “overlapped” as much as possible in order to save space.
For more data compression related issues, see next chapter.
Other than compressing a sentence about Alf, the shortest common superstring problem has more important applications in DNA sequencing.
A DNA sequence may be considered as a long character string over the alphabet of nucleotides {A, C, G, T}.
Such a character string ranges from a few thousand symbols long for a simple virus, to 2 x 108 symbols for a fly and 3 x 109 symbols for a human being.
Determining this string for different molecules, or sequencing the molecules, is a crucial step towards understanding the biological functions of the molecules.
In fact, today, no problem in biochemistry can be studied in isolation from its genetic background.
However, with current laboratory methods, such as Sanger’s procedure, it is quite impossible to sequence a long molecule directly as a whole.
Each time, a randomly chosen fragment of less than 500 base pairs can be sequenced.
In general, biochemists “cut”, using different restriction enzymes, millions of such (identical) molecules into pieces each typically containing about 200-500 nucleotides (characters).
A biochemist “samples” the fragments and Sanger’s procedure is applied to sequence the sampled fragment.
.
.
.

Related Results

Frequency of Common Chromosomal Abnormalities in Patients with Idiopathic Acquired Aplastic Anemia
Frequency of Common Chromosomal Abnormalities in Patients with Idiopathic Acquired Aplastic Anemia
Objective: To determine the frequency of common chromosomal aberrations in local population idiopathic determine the frequency of common chromosomal aberrations in local population...
Implementation of the A Star Heuristic Search Algorithm in Determining the Shortest Path
Implementation of the A Star Heuristic Search Algorithm in Determining the Shortest Path
Finding the shortest path in a graph can be applied to various fields of shortest distance costs in routes, computer games, robotics or navigation. This study implements the A star...
Directed Shortest Walk on Temporal Graphs
Directed Shortest Walk on Temporal Graphs
Abstract Background The use of graphs as a way of abstracting and representing biological systems has provided a powerful analy...
Shortest paths avoiding forbidden subpaths
Shortest paths avoiding forbidden subpaths
AbstractWe study a variant of the shortest path problem in graphs: given a weighted graph Gand vertices sand t, and given a set Xof forbidden paths in G, find a shortest s‐ tpath P...
THE SEARCH FOR THE SHORTEST ROUTE FOR TOURISTS VISITING SIGHTSEEING OBJECTS OF THE RAZNA NATIONAL PARK
THE SEARCH FOR THE SHORTEST ROUTE FOR TOURISTS VISITING SIGHTSEEING OBJECTS OF THE RAZNA NATIONAL PARK
The aim of the paper is to popularize the Razna National Park’s tourist attractions. The opportunity to choose the shortest route to visit all the most interesting potential sights...
A genetic algorithm for shortest path with real constraints in computer networks
A genetic algorithm for shortest path with real constraints in computer networks
<span lang="EN-US">The shortest path problem has many different versions. In this manuscript, we proposed a muti-constrained optimization method to find the shortest path in ...
TIME COMPLEXITY ANALYSIS OF SINGLE SOURCE SHORTEST PATH (SSSP) ALGORITHMS
TIME COMPLEXITY ANALYSIS OF SINGLE SOURCE SHORTEST PATH (SSSP) ALGORITHMS
There are real-world complex networks formed by people, roads, communication network nodes, genes, file Servers and financial transactions etc based on their interdependent associa...
The Application of Dynamic Programming Method in Finding Shortest Path for Order Picker with Limited Picking Capacity
The Application of Dynamic Programming Method in Finding Shortest Path for Order Picker with Limited Picking Capacity
Companies are looking forward to improve their productivity within their warehouse operations and distribution centres. In a typical warehouse operation, order picking contributes ...

Back to Top