Artur Czumaj, Leszek Gasieniec, et al.  Home/Search
Context Related
| unipaderborn.de/do...trri94150.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: indiana.edu/pub/ucstri/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Superstrings have many applications in data compression and genetics. However the decision version of the shortest superstring problem is NP-complete. In this paper we examine the complexity of approximating shortest superstrings. There are two basic measures of the approximations: the approximation ratio and the compression ratio. The well known and practical approximation algorithm is the sequential algorithm Greedy . It approximates the shortest superstring with the compression ratio of 1 2 ... (Update)
Similar documents based on text: More All
1.1: Parallel and Sequential Approximation of Shortest.. - Czumaj, Gasieniec.. (1994) (Correct)
0.8: Work-Time-Optimal Parallel Algorithms for String Problems.. - Czumaj, al. (1995) (Correct)
0.8: Randomized Efficient Algorithms for Compressed Strings: the.. - Gasieniec, al. (1996) (Correct)
BibTeX entry: (Update)
Czumaj, A., G¸asieniec, L., Piotr'ow, M., and Rytter, W. (1994b), "Sequential and parallel approximation of shortest superstrings," Technical Report TR-RI-94-150, University of Paderborn. http://citeseer.ist.psu.edu/czumaj94sequential.html More
@article{ czumaj97sequential,
author = "Artur Czumaj and Leszek Gasieniec and Marek Piotrow and Wojciech Rytter",
title = "Sequential and Parallel Approximation of Shortest Superstrings",
journal = "J. Algorithms",
volume = "23",
number = "1",
pages = "74-100",
year = "1997",
url = "citeseer.ist.psu.edu/czumaj94sequential.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NPcom.. (context) - Garey, Johnson - 1979
482 Combinatorial Optimization: Algorithms and Complexity (context) - Papadimitriou, Steiglitz - 1982
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
314 An Introduction to Parallel Algorithms (context) - J'aJ'a - 1992
300 the hardness of approximating minimization problems (context) - Lund, Yannakakis - 1993
219 and complexity classes (context) - Papadimitriou, Yannakakis et al. - 1988
199 A simple parallel algorithm for the maximal independent set .. (context) - Luby - 1986
139 A greedy heuristic for the set-covering problem (context) - Chvatal - 1979
48 Linear approximation of shortest superstrings - Blum, Jiang et al. - 1991
27 Data Compression: Methods and theory (context) - Storer - 1988
26 An improved parallel algorithm for maximal matching (context) - Israeli, Shiloach - 1986
25 Approximation algorithms for the shortest common superstring.. (context) - Turner - 1989
24 On finding minimal length superstrings (context) - Gallant, Maier et al. - 1980
20 Towards a DNA sequencing theory (context) - Li - 1990
20 Efficient NC algorithms for set cover with applications to l.. (context) - Berger, Rompel et al. - 1989
[Article contains additional citations not shown here]
Documents on the same site (http://ftp.cs.indiana.edu/pub/ucstri/index): More
Selection of Test Points during High-Level Synthesis - Nagel (Correct)
Game Tree Search on a Massively Parallel System - Feldmann, Mysliwietz, Monien (1993) (Correct)
Computing the Discrepancy with Applications to.. - Dobkin, Eppstein.. (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC