An 8/13-approximation algorithm for the asymmetric maximum TSP
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating asymmetric maximum TSP
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On the Approximation Ratio of the Group-Merge Algorithm for the Shortest Common Suerstring Problem
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
An 8/13-approximation algorithm for the asymmetric maximum TSP
Journal of Algorithms
The greedy algorithm for shortest superstrings
Information Processing Letters
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM (JACM)
The Shortest Common Superstring Problem and Viral Genome Compression
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Why Greed Works for Shortest Common Superstring Problem
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Minimum-weight cycle covers and their approximability
Discrete Applied Mathematics
Reoptimization of the Shortest Common Superstring Problem
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Why greed works for shortest common superstring problem
Theoretical Computer Science
The greedy algorithm for shortest superstrings
Information Processing Letters
Minimum-weight cycle covers and their approximability
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Shortest common superstring problem with discrete neural networks
ICANNGA'09 Proceedings of the 9th international conference on Adaptive and natural computing algorithms
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
On shortest common superstring and swap permutations
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Restricted common superstring and restricted common supersequence
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Approximation algorithms for restricted cycle covers based on cycle decompositions
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
DNA'06 Proceedings of the 12th international conference on DNA Computing
Explicit inapproximability bounds for the shortest superstring problem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The Shortest Common Superstring Problem and Viral Genome Compression
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Restricted and swap common superstring: a parameterized view
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
A probabilistic PTAS for shortest common superstring
Theoretical Computer Science
Hi-index | 0.00 |
Given a set of strings S={s1,s2. . . ,sn} over a finite alphabet $\Sigma$, a superstring of S is a string that contains each si as a contiguous substring. The shortest superstring (SS) problem is to find a superstring of minimum length.This problem has important applications in computational biology and in data compression (see, respectively, [A. Lesk, ed., Computational Molecular Biology, Sources and Methods for Sequence Analysis, Oxford University Press, Oxford, 1988]; [J. Storer, Data Compression: Methods and Theory, Computer Science Press, Rockville, MD, 1988]). SS is MAX SNP-hard [A. Blum et al., Proc. 23rd Annual ACM Symposium on Theory of Computing, ACM, New York, 1991, pp. 328--336] so it is unlikely that the length of a shortest superstring can be approximated to within an arbitrary constant. Several heuristics have been suggested and it is conjectured that GREEDY achieves an approximation factor of 2. This, unfortunately, remains an open question.Several linear approximation algorithms for SS have been proposed. The first, by Blum et al. [ Proc. 23rd Annual ACM Symposium on Theory of Computing, ACM, New York, 1991, pp. 328--336], guarantees a performance factor of 3. The factor has been successively improved to $2\frac{8}{9}$, $2 \frac{5}{6}$, $2 \frac{50}{63}$, $2 \frac{3}{4}$, $2\frac{2}{3}$, and $2.596$ (see, respectively, [S. Teng and F. Yao, Proc. 34th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Piscataway, NJ, 1993, pp. 158--165]; [A. Czumaj et al., Proc. First Scandinavian Workshop on Algorithm Theory, Lecture Notes in Comput. Sci. 824, Springer-Verlag, Berlin, 1994, pp. 95--106]; [R. Kosaraju, J. Park, and C. Stein, Proc. 35th Annual IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Piscataway, NJ, 1994, pp. 166--177]; [C. Armen and C. Stein, Proc. 5th Internat. Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sci. 955, Springer-Verlag, Berlin, 1995, pp. 494--505]; [C. Armen and C. Stein, Proc. Combinatorial Pattern Matching, Lecture Notes in Comput. Sci. 1075, Springer-Verlag, Berlin, 1996, pp. 87--101]; and [D. Breslauer, T. Jiang, and Z. Jiang, J. Algorithms, 24 (1997), pp. 340--353]). In this paper we give an algorithm that guarantees a $2\frac{1}{2}$-approximation factor.