A (Formula presented)-approximation algorithm for the shortest superstring problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1075, Issue , 1996, Pages 87-101

  Armen, Chris ^a   Stein, Clifford ^b  

^a UNIVERSITY OF HARTFORD   (United States)

^b DARTMOUTH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOINFORMATICS; DATA COMPRESSION; MACHINERY; PATTERN MATCHING; STRING THEORY;

APPROXIMATION RATIOS; COMPUTATIONAL BIOLOGY; MAX SNP-HARD; OPTIMAL SOLUTIONS; SHORTEST SUPERSTRING PROBLEM; SUBSTRING;

APPROXIMATION ALGORITHMS;

EID: 84957686125     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61258-0_8     Document Type: Conference Paper

References (23)

1. C. Armen and C. Stein. Improved length bounds for the shortest superstring problem. In Proceedings of Workshop on Algorithms and Data Structures, pages 494-505, 1995.
2. C. Armen and C. Stein. A (Formula presented)-approximation algorithm for the shortest superstring problem. Technical Report PCS-TR95-262, Dartmouth College, June 1995.
3. C. Armen and C. Stein. Short superstrings and the structure of overlapping strings. To appear in J. of Computational Biology, 1996.
4. Chris Armen. Approximation Algorithms for the Shortest Superstring Problem. PhD thesis, Dartmouth College, July 1995.
5. A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis. Linear approximation of shortest superstrings. Journal of the ACM, 41(4):630-647, July 1994.
6. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press/McGraw-Hill, 1990.
7. A. Czumaj, L. Gasieniec, M. Piotrow, and W. Rytter. Parallel and sequential approximations of shortest superstrings. In Proceedings of Fourth Scandinavian Workshop on Algorithm Theory, pages 95-106, 1994.
8. A. Lesk (edited). Computational Molecular Biology, Sources and Methods for Sequence Analysis. Oxford University Press, 1988.
9. A.M. Frieze, G. Galbiati, and F. Maffoli. On the worst case performance of some algorithms for the asymmetric travelling salesman problem. Networks, 12:23-39, 1982.
10. J. Gallant, D. Maier, and J. Storer. On finding minimal length superstrings. Journal of Computer and System Sciences, 20:50-58, 1980.
11. D. Gusfield, G. Landau, and B. Schieber. An efficient algorithm for the all pairs suffix-prefix problem. Information Processing Letters, (41):181-185, March 1992.
12. Tao Jiang and Zhigen Jiang. Rotation of periodic strings and short superstrings. Unpublished Manuscript courtesy Tao Jiang March 1996.
13. Tao Jiang and Ming Li. Approximating shortest superstrings with constraints. Therotical Computer Science, (134):473-491, 1994.
14. J.D. Kececioglu and E.W. Myers. Combinatorial algorithms for dna sequence assembly. Algorithmica, 13(l/2):7-51, 1995.
15. John D. Kececioglu. Exact and approximation algorithms for DNA sequence reconstruction. PhD thesis, University of Arizona, 1991.
16. R. Kosaraju, J. Park, and C. Stein. Long tours and short superstrings. In Proceedings of the 35ih Annual Symposium on Foundations of Computer Science, November 1994.
17. M. Li. Towards a DNA sequencing theory (learning a string). In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 125-134, 1990.
18. Christos H. Papadimitriou and Kenneth Steiglitz. Combinatorial Optimization, Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982.
19. H. Peltola, H. Soderlund, J. Tarjio, and E. Ukkonen. Algorithms for some string matching problems arising in molecular genetics. In Proceedings of the IFIP Congress, pages 53-64, 1983.
20. Graham A. Stephen. String searching algorithms. World Scientific, 1994.
21. J. Storer. Data compression: methods and theory. Computer Science Press, 1988.
22. Shang-Hua Teng and Prances Yao. Approximating shortest superstrings. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science, pages 158-165, November 1993.
23. J. Turner. Approximation algorithms for the shortest common superstring problem. Information and Computation, 83:1-20, 1989.