Linear approximation of shortest superstrings

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130073, Issue , 1991, Pages 328-336

  Blum, Avrim ^a   Jiangt, Tao ^b   Li, Ming ^c   Tromps, John ^c   Yannakakisf, Mihalis ^d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MCMASTER UNIVERSITY   (Canada)

^c UNIVERSITY OF WATERLOO   (Canada)

^d LUCENT TECHNOLOGIES   (United States)

Author keywords

Approximation Algorithms; Shortest Common Superstring

Indexed keywords

COMPUTATION THEORY; DNA SEQUENCES; GENE ENCODING; POLYNOMIAL APPROXIMATION; STRING THEORY;

CONSTANT FACTORS; FOLLOWING PROBLEM; GREEDY ALGORITHMS; LINEAR APPROXIMATIONS; POLYNOMIAL TIME APPROXIMATION SCHEMES; POLYNOMIAL-TIME ALGORITHMS; SHORTEST COMMON SUPERSTRINGS; SUPERSTRING PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 84936676730     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/103418.103455     Document Type: Conference Paper

References (12)

1. J. Gallant, D. Maier, J. Storer. On finding minimal length superstring. Journal of Computer and System Sciences 20, 50-58, 1980
2. M. Garey and D. Johnson. Computers and Intractability Freeman, New York, 1979
3. A. Lesk (Edited). Computational Molecular Biology, Sources and Methods for Sequence Analysis Oxford University Press, 1988
4. M. Li. Towards a DNA sequencing theory. 91st IEEE Symp. on Foundations of Computer Science, 15-194, 1990
5. C. Papadimitriou and K. Steiglitz. Combinatorial Optimiation: Algorithms and Complexity Prentice-Hall, 1982
6. C. Papadimitriou and M Yannakakis. Optimization, approximation and complexity classes. , 20th ACM Symp. on Theory of Computing, 229-234, 1988
7. C. Papadimitriou and M Yannakakis. The traveling salesman problem with distances one and two Mathematics of Operations Research. To appear
8. H. Peltola, H. Soderlund, J. Tarhio, and E. Ukkonen Algorithms for some string matching problems arising in molecular genetics. Information Processing 83 (Proc. IFIP Congress, 1983) 59-6./
9. J. Storer. Data compression: methods and theory Computer Science Press, 1988
10. J. Tarhio and E. Ukkonen. A Greedy approximation algorithm for constructing shortest common superstrings. Theoretical Computer Science 57131-1451988
11. J. Turner. Approximation algorithms for the shortest common superstring problem. Information and Computation 831-201989
12. L. G. Valiant. A Theory of the Learnable. Comm ACM 27(11) 1134-11421984