Sequential and Parallel Algorithms for the Shortest Common Superstring Problem
نویسندگان
چکیده
We design sequential and parallel genetic algorithms, simulated annealing algorithms and improved greedy algorithms for the shortest common superstring problem(SCS), which is to find the shortest string that contains all strings from a given set of strings. The SCS problem is NP-complete [7]. It is even MAX SNP hard [2] i.e. no polynomial-time algorithm exists, that can approximate the optimum to within a predetermined constant unless P=NP. We compare the above mentioned algorithms applied to several randomly generated test cases. The test results show the superiority of the parallel island genetic algorithm.
منابع مشابه
Lecture 3 — Algorithmic Techniques and Analysis Parallel and Sequential Data
There are many algorithmic techniques/approaches for solving problems. Understanding when and how to use these techniques is one of the most important skills of a good algorithms designer. In the context of the shortest superstring (SS) problem we already mentioned three techniques: brute force, reducing one problem to another, and the greedy approach. In this course we will cover many techniqu...
متن کاملLecture 3 — Algorithmic Techniques and Divide - and - Conquer
There are many algorithmic techniques/approaches for solving problems. Understanding when and how to use these techniques is one of the most important skills of a good algorithms designer. In the context of the shortest superstring (SS) problem we already mentioned three techniques: brute force, reducing one problem to another, and the greedy approach. In this course we will cover many techniqu...
متن کاملSequential and Parallel Approximation of Shortest Superstrings
Superstrings have many applications in data compression and genetics. However, the decision version of the shortest superstring problem is N P-complete. In this paper we examine the complexity of approximating shortest superstrings. There are two basic measures of the approximations: the length factor and the compression factor. The well known and practical approximation algorithm is the sequen...
متن کاملLecture 3 — Algorithmic Techniques and Analysis
Given an algorithmic problem, where do you even start? It turns out that most of the algorithms follow several well-known techniques. For example, when solving the shortest superstring (SS) problem we already mentioned three techniques: brute force, reducing one problem to another, and the greedy approach. In this lecture, we will go over these techniques, which are key to both sequential and p...
متن کاملAn Experimental Comparison of Approximation Algorithms for the Shortest Common Superstring Problem
The paper deals with an experimental comparison of a 4-approximation algorithm with a 3-approximation algorithm for the Shortest Common Superstring (SCS) problem. It has two main objectives, one is to show that even though the quotient between the two approximations is 4/3, in the worst case, the average results quotient is approximately 1, independently of the instances size. The second object...
متن کامل