Why greed works for shortest common superstring problem

Theoretical Computer Science

Volumn 410, Issue 51, 2009, Pages 5374-5381

  Ma, Bin ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Polynomial time approximation scheme; Shortest common superstring; Smoothed analysis

Indexed keywords

APPROXIMATION RATIOS; ASYMPTOTICALLY OPTIMAL; DNA SEQUENCE ASSEMBLY; DNA SEQUENCING; GREEDY ALGORITHMS; POLYNOMIAL TIME APPROXIMATION SCHEME; RANDOM INSTANCE; RANDOM PERTURBATIONS; SHORTEST COMMON SUPERSTRING; SHORTEST COMMON SUPERSTRINGS; SMOOTHED ANALYSIS; STRING COMPRESSION; WORST CASE;

DNA; DNA SEQUENCES; GENES; NUCLEIC ACIDS; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 70349928668     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.09.014     Document Type: Article

References (22)

1. Alexandr Andoni, Robert Krauthgamer, The smoothed complexity of edit distance, in: Proc. of the 35th International Colloquium Automata, Languages and Programming, 2008, pp. 357-369
2. C. Armen, C. Stein, A 2 2/3-approximation algorithm for the shortest superstring problem, in: Proc. 7th Annual Symposium on Combinatorial Pattern Matching (CPM), 1996, pp. 87-101
3. Bellare M., Goldreich O., and Sudan M. Free bits, pcps and non-approximability - Towards tight results. SIAM Journal on Computing 27 (1998) 804-915
4. Blum A., Jiang T., Li M., Tromp J., and Yannakakis M. Linear approximation of shortest superstrings. Journal of the Association for Computer Machinery 41 4 (1994) 630-647
5. Breslauer D., Jiang T., and Jiang Z. Rotations of periodic strings and short superstrings. Journal of Algorithms 24 2 (1997) 340-353
6. Frieze A.M., and Szpankowski W. Greedy algorithms for the shortest common superstring that are asymptotically optimal. Algorithmica 21 1 (1998) 21-36
7. Gallant J., Maier D., and Storer J. On finding minimal length superstrings. Journal of Computer and System Sciences 20 (1980) 50-58
8. Storer J. Data Compression: Methods and Theory (1988), Addison-Wesley
9. Tarhio J., and Ukkonen E. A greedy approximation algorithm for constructing shortest common superstrings. Theoretical Computer Science 57 (1988) 131-145
10. Turner J. Approximation algorithms for the shortest common superstring problem. Information and Computation 83 (1989) 1-20
11. Kaplan H., and Shafrir N. The greedy algorithm for shortest superstrings. Information Processing Letters 93 (2005) 13-17
12. Ming Li, Towards a DNA sequencing theory, in: Proc. of the 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 125-134
13. Waterman M.S. Introduction to Computational Biology: Maps, Sequences, and Genomes (1995), Chapman and Hall
14. A.S. Rebaï, M. Elloumi, Approximation algorithm for the shortest approximate common superstring problem, in: Proc. 12th Word Academy of Science, Engineering and Technology, 2006, pp. 302-307
15. Heidi J. Romero, Carlos A. Brizuela, Andrei Tchernykh, An experimental comparison of approximation algorithms for the shortest common superstring problem, in: Proc. Fifth Mexican International Conference in Computer Science, ENC'04, 2004, pp. 27-34
16. Shapiro M.B. An algorithm for reconstructing protein and RNA sequences. Journal of ACM 14 4 (1967) 720-731
17. Spielman D.A., and Teng S.-H. Smoothed analysis: Motivation and discrete models. Proc. of Seventh Workshop on Algorithms and Data Structures. LNCS vol. 2748 (2003) 256-270
18. Spielman D.A., and Teng S.-H. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of ACM 51 3 (2004) 385-463
19. Sweedyk Z. 2.5-approximation algorithm for shortest superstring. SIAM Journal on Computing 29 3 (2000) 954-986
20. S.H. Teng, F. Yao, Approximating shortest superstrings, in: Proc. 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 158-165
21. Vassilevska V. Explicit inapproximability bounds for the shortest superstring problem. Proc. 30th International Symposium on Mathematical Foundations of Computer Science. LNCS vol. 3618 (2005) 793-800
22. Yang E.H., and Zhang Z. Shortest common superstring problem: Average case analysis for both exact and approximate matching. IEEE Transactions on Information Theory 45 6 (1999) 1867-1886